How to meet when you forget: log-space rendezvous in arbitrary graphs

DOI10.1007/s00446-011-0141-9zbMath1284.68066MaRDI QIDQ1938363

Jurek Czyzowicz, Andrzej Pelc, Adrian Kosowski

Publication date: 4 February 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-011-0141-9

zbMATH Keywords

rendezvous; graph exploration; compact data structure

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68P05: Data structures

68M14: Distributed systems