Constructing a Map of an Anonymous Graph: Applications of Universal Sequences
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 119-134
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- THE SPACE COMPLEXITY OF LEADER ELECTION IN ANONYMOUS NETWORKSInternational Journal of Foundations of Computer Science, 2010
- Undirected connectivity in log-spaceJournal of the ACM, 2008
- Universal traversal sequences with backtrackingJournal of Computer and System Sciences, 2002
- Rendezvous search when marks are left at the starting pointsNaval Research Logistics (NRL), 2001
- Exploring Unknown EnvironmentsSIAM Journal on Computing, 2000
- Exploring Unknown Undirected GraphsJournal of Algorithms, 1999
- Exploring an unknown graphJournal of Graph Theory, 1999
- Computing on anonymous networks. I. Characterizing the solvable casesIEEE Transactions on Parallel and Distributed Systems, 1996
- Universal covers of graphs: Isomorphism to depth n − 1 implies isomorphism to all depthsDiscrete Applied Mathematics, 1995
- Robotic exploration as graph constructionIEEE Transactions on Robotics and Automation, 1991