Deterministic Rendezvous in Trees with Little Memory

DOI10.1007/978-3-540-87779-0_17zbMath1161.68336OpenAlexW1526420573MaRDI QIDQ3540234

Pierre Fraigniaud, Andrzej Pelc

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87779-0_17

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (17)

Byzantine gathering in networks ⋮ Byzantine gathering in polynomial time ⋮ Move-optimal partial gathering of mobile agents in asynchronous trees ⋮ Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Unnamed Item ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains ⋮ How much memory is needed for leader election ⋮ Gathering of robots in a ring with mobile faults ⋮ Time versus space trade-offs for rendezvous in trees ⋮ Quiescence of self-stabilizing gossiping among mobile agents in graphs ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Unnamed Item ⋮ Anonymous meeting in networks

This page was built for publication: Deterministic Rendezvous in Trees with Little Memory