Label-guided graph exploration by a finite automaton

ACM Transactions on Algorithms

Volumn 4, Issue 4, 2008, Pages

  Cohen, Reuven ^a,d   Fraigniaud, Pierre ^b   Ilcinkas, David ^b   Korman, Amos ^b   Peleg, David ^c  

^a BOSTON UNIVERSITY   (United States)

^b CNRS   (France)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d Boston University   (United States)

Author keywords

Distributed algorithms; Graph exploration; Labeling schemes

Indexed keywords

GRAPH THEORY; PARALLEL ALGORITHMS;

BOUNDED DEGREE GRAPHS; EXPLORATION ALGORITHMS; GRAPH EXPLORATION; IMPOSSIBILITY RESULTS; LABEL-GUIDED GRAPH EXPLORATION; LABELING ALGORITHMS; LABELING SCHEME; PRE-PROCESSING STAGES;

ROBOTS;

EID: 50849145170     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1383369.1383373     Document Type: Article

References (13)

1. BLUM, M., AND KOZEN, D. 1978. On the power of the compass (or, why mazes are easier to search than graphs). In Proceedings of the 19th Symposium on Foundations of Computer Science (FOCS), 132-142.
2. BUDACH, L. 1978. Automata and labyrinths. Math. Nachrichten, 195-282.
3. DIKS, K., FRAIGNIAUD, P., KRANAKIS, E., AND PELC, A. 2004. Tree exploration with little memory. J. Algor. 51, 1, 38-63.
4. FRAIGNIAUD, P., ILCINKAS, D., PEER, G., PELC, A., AND PELEG, D. 2005. Graph exploration by a finite automaton. Theor. Comput. Sci. 345, 2-3, 331-344.
5. FRAIGNIAUD, P., ILCINKAS, D., AND PELC, A. 2006. Oracle size: A new measure of difficulty for communication tasks. In Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC).
6. FRAIGNIAUD, P., ILCINKAS, D., RAJSBAUM, S., AND TIXEUIL, S. 2005. Space lower bounds for graph exploration via reduced automata. In Proceedings of the 12th international Colloquium on Structural Information and Communication Complexity (SIROCCO), 140-154.
7. FRAIGNIAUD, P., KORMAN, A., AND LEBHAR, E. 2007. Local MST computation with short advice. In Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
8. GASIENIEC, L, PELC, A, RADZIK, T, AND ZHANG, X. 2007. Tree exploration with logarithmic memory. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 585-594.
9. KORMAN, A., KUTTEN, S., AND PELEG, D. 2005. Proof labeling schemes. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC).
10. KOZEN, D. 1979. Automata and planar graphs. In Proceedings of the Conference on Fundamentals of Computation Theory (FCT), 243-254.
11. RABIN, M. O. 1967. Maze threading automata. In a seminar talk presented at the University of California at Berkeley.
12. ROLLIK, H. A. 1980. Automaten in planaren graphen. Acta Informatica 13, 287-298.
13. SHANNON, C. E. 1951. Presentation of a maze-solving machine. In Proceedings of the 8th Conference of the Josiah Macy Jr. Foundation (Cybernetics), 173-180.