Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty
- 4 April 2013
- book chapter
- Published by Springer Nature
- p. 175-195
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Time vs. space trade-offs for rendezvous in trees2012
- How to meet when you forget: log-space rendezvous in arbitrary graphsDistributed Computing, 2011
- How to meet asynchronously (almost) everywhere2010
- Rendezvous of Mobile Agents without Agreement on Local OrientationLecture Notes in Computer Science, 2010
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids2010
- Rendezvous of Mobile Agents in Directed GraphsLecture Notes in Computer Science, 2010
- Constructing a Map of an Anonymous Graph: Applications of Universal Sequences2010
- Rendezvous of Mobile Agents in Unknown Graphs with Faulty LinksLecture Notes in Computer Science, 2007
- Fibrations of graphsDiscrete Mathematics, 2002
- Random walks, universal traversal sequences, and the complexity of maze problems1979