Deterministic Rendezvous in Trees with Little Memory

DOI10.1007/978-3-540-87779-0_17zbMath1161.68336MaRDI 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

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

68M14: Distributed systems

Related Items

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