Map construction of unknown graphs by multiple agents
Authors:
- 1 October 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 385 (1-3) , 34-48
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Optimal graph exploration without good mapsTheoretical Computer Science, 2004
- Tree exploration with little memoryJournal of Algorithms, 2004
- Exploring Unknown EnvironmentsSIAM Journal on Computing, 2000
- Exploring Unknown Undirected GraphsJournal of Algorithms, 1999
- Exploring an unknown graphJournal of Graph Theory, 1999
- algorithms for p-traveling salesmen problems on a tree with minmax objectiveDiscrete Applied Mathematics, 1997
- Computing on anonymous networks. I. Characterizing the solvable casesIEEE Transactions on Parallel and Distributed Systems, 1996
- Robotic exploration as graph constructionIEEE Transactions on Robotics and Automation, 1991
- A modular technique for the design of efficient distributed leader finding algorithmsACM Transactions on Programming Languages and Systems, 1990
- Uniform self-stabilizing ringsACM Transactions on Programming Languages and Systems, 1989