Distributed exploration of an unknown graph

Lecture Notes in Computer Science

Volumn 3499, Issue , 2005, Pages 99-114

  Das, Shantanu ^a   Flocchini, Paola ^a   Nayak, Amiya ^a   Santoro, Nicola ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; KNOWLEDGE ACQUISITION; NETWORK PROTOCOLS; PROBLEM SOLVING; SOFTWARE AGENTS; TOPOLOGY;

ASYNCHRONOUS AGENTS; DETERMINISTIC ALGORITHMS; DISTRIBUTED EXPLORATION; UNDIRECTED GRAPHS;

GRAPH THEORY;

EID: 24944457147     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11429647_10     Document Type: Conference Paper

References (23)

1. S. Albers and M. Henzinger, "Exploring unknown environments", In Proc. 29th Annual ACM Symp. Theory Comput., 416-425, 1997.
2. S. Alpern and S. Gal, The Theory of Search Games and Rendezvous, Kluwer, 2003.
3. L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro, "Can we elect if we cannot compare?", In Proc. 15th ACM Symp. on Parallel Algorithms and Architectures (SPAA'03), 200-209, 2003.
4. L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro, "Election and rendezvous in fully anonymous systems with sense of direction", In Proc. 10th Coll. on Structural Information and Communication complexity (SIROCCO'03), 17-32, 2003.
5. M. Bender, A. Fernandez, D. Ron, A. Sahai, and S. Vadhan, "The power of a pebble: Exploring and mapping directed graphs", In Proc. 30th ACM Symp. on Theory of Computing (STOC'98), 269-287, 1998.
6. M. Bender and D. K. Slonim, "The power of team exploration: two robots can learn unlabeled directed graphs", In Proc. 35th Symp. on Foundations of Computer Science (FOCS'94), 75-85, 1994.
7. X. Deng and C. H. Papadimitriou, "Exploring an unknown graph". J. of Graph Theory 32(3), 265-297, 1999.
8. A. Dessmark, P. Fraigniaud, and A. Pelc, "Deterministic rendezvous in graphs", In Proc. 11th European Symposium on Algorithms (ESA'03), 184-195, 2003.
9. A. Dessmark and A. Pelc, "Optimal graph exploration without good maps", In Proc. 10th European Symposium on Algorithms (ESA'02), 374-386, 2002.
10. K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc, "Tree exploration with little memory", Journal of Algorithms, 51:38-63, 2004.
11. G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction", Transactions on Robotics and Automation, 7(6):859-865, 1991.
12. P. Flocchini, E. Kranakis, D. Krizanc, N. Santoro, C. Sawchuk, "Multiple mobile agent rendezvous in a ring". Proc. 6th Latin American Theoretical Informatics Symp. (LATIN'04), 599-608, 2004.
13. P. Fraigniaud, L. Gasieniec, D. Kowalski, and A. Pelc, "Collective tree exploration", In 6th Latin American Theoretical Informatics Symp. (LATIN'04), 141-151, 2004.
14. P. Fraigniaud and D. Ilcinkas, "Digraph exploration with little memory", Proc. 21st Symp. on Theoretical Aspects of Computer Science (STACS'04), Montpellier, 246-257, 2004.
15. P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, and D. Peleg, "Graph exploration by a finite automaton", In 29th Symposium on Mathematical Foundations of Computer Science (MFCS), 451-462, 2004.
16. P. Fraigniaud, A. Pelc, D. Peleg, and S. Perennes, "Assigning labels in unknown anonymous networks with a leader", Distributed Computing 14(3), 163-183, 2001.
17. R. G. Gallager, P. A. Humblet, and P. M. Spira, "A distributed algorithm for minimum-weight spanning trees", A CM Transactions on Programming Languages and Systems 5(1), 66-77, Jan. 1983.
18. E. Korach, S. Kutten, S. Moran, "A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms", ACM Transactions on Programming Languages and Systems 12(1), 84-101, 1990.
19. E. Kranakis, D. Krizanc, N. Santoro, and C. Sawchuk, "Mobile agent rendezvous in a ring", In Int. Conf. on Distibuted Computing Systems (ICDCS 03), 592-599, 2003.
20. P. Panaite and A. Pelc, "Exploring unknown undirected graphs", Proc. 9th ACM-SIAM Symp. on Discrete Algorithms (SODA'98), 316-322, 1998.
21. P. Panaite and A. Pelc, "Impact of topographic information on graph exploration efficiency", Networks, 36 (2000), 96-103, 2000.
22. N. Sakamoto, "Comparison of initial conditions for distributed algorithms on anonymous networks", Proc. 18th ACM Symposium on Principles of Distributed Computing (PODC'99), 173-179, 1999.
23. X. Yu and M. Yung, "Agent rendezvous: A dynamic symmetry-breaking problem", In Int. Coll. on Automata Languages and Programming (ICALP'96), 610-621, 1996.