Abstract
Two mobile agents having distinct identifiers and located in nodes of an unknown anonymous connected graph, have to meet at some node of the graph. We present fast deterministic algorithms for this rendezvous problem. © Springer-Verlag 2003.
Cite
CITATION STYLE
APA
Dessmark, A., Fraigniaud, P., & Pelc, A. (2003). Deterministic Rendezvous in Graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2832, 184–195. https://doi.org/10.1007/978-3-540-39658-1_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free