Finding short right-hand-on-the-wall walks in graphs

Lecture Notes in Computer Science

Volumn 3499, Issue , 2005, Pages 127-139

  Dobrev, Stefan ^a   Jansson, Jesper ^b   Sadakane, Kunihiko ^d   Sung, Wing Kin ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^d KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION TABLES; INFORMATION RETRIEVAL; PROBLEM SOLVING; SOFTWARE AGENTS; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

DETERMINISTIC ALGORITHMS; ROUTING TABLES; SPANNING TREES; UNDIRECTED GRAPHS;

GRAPH THEORY;

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

References (29)

1. S. Albers and M. R. Henzinger. Exploring unknown environments. SIAM Journal on Computing, 29:1164-1188, 2000.
2. N. Alon, Y. Azar, and Y. Ravid. Universal sequences for complete graphs. Discrete Appl. Math., 27(1-2):25-28, 1990.
3. B. Awerbuch, M. Betke, and M. Singh. Piecemeal graph learning by a mobile robot. Information and Computation, 152:155-172, 1999.
4. A. Bar-Noy, A. Borodin, M. Karchmer, N. Linial, and M. Werman. Bounds on universal sequences. SIAM J. Comput., 18:268-277, 1989.
5. M. Bender, A. Fernandez, D. Ron, A. Sahai, and S. Vadhan. The power of a pebble: Exploring and mapping directed graphs. In Proc. of STOC 98, pages 269-287, 1998.
6. M. Bender and D. K. Slonim. The power of team exploration: two robots can learn unlabeled directed graphs. In Proc. of FOCS 94, pages 75-85, 1994.
7. A. Blum, P. Raghavan, and B. Schieber. Navigating in unfamiliar geometric terrain. SIAM Journal on Computing, 26:110-137, 1997.
8. M. Blum and D. Kozen. On the power of the compass (or, why mazes are easier to search than graphs). In Proc. of FOCS 78, pages 132-142, 1978.
9. L. Budach. Automata and labyrinths. Math. Nachrichten, pages 195282, 1978.
10. Harry Buhrman, Matthew Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, and Paul Vitányi. Mutual search. J. ACM, 46(4):517-536, 1999.
11. X. Deng, T. Kameda, and C. H. Papadimitriou. How to learn an unknown environment i: The rectilinear case. Journal of the ACM, 45:215-245, 1998.
12. X. Deng and C. H. Papadimitriou. Exploring an unknown graph. Journal of Graph Theory, 32(3):265-297, 1999.
13. A. Dessmark and A. Pelc. Optimal graph exploration without good maps. In Proc. 10th European Symposium on Algorithms (ESA'02), pages 374-386, 2002.
14. K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc. Tree exploration with little memory. Journal of Algorithms, 51:38-63, 2004.
15. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Finding a black hole in an arbitrary network: optimal mobile agents protocols. In Proc. of PODC 2002, pages 153-162, 2002.
16. C.A Duncan, S.G. Kobourov, and V.S.A Kumar. Optimal constrained graph exploration. In 12th ACM-SIAM Symposium on Discrete Algorithms (SODA'01), pages 807-814, 2001.
17. P. Flocchini, B. Mans, and N. Santoro. On the impact of sense of direction on communication complexity. Information Processing Letters, 63(1):23-31, 1997.
18. P. Flocchini, B. Mans, and N. Santoro. Sense of direction: definition, properties and classes. Networks, 32(3): 165-180, 1998.
19. P. Fraigniaud, C. Gavoille, and B. Mans. Interval routing schemes allow broadcasting with linear message-complexity. Journal of Distributed Computing, 14(4):217-229, 2001.
20. P. Fraigniaud and D. Ilcinkas. Digraph exploration with little memory. In 21st Symp. on Theoretical Aspects of Computer Science (STACS'04), 2004.
21. P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, and D. Peleg. Graph exploration by a finite automaton. In Proc. of MFCS 2004, pages 451-462, 2004.
22. U. Friege. A tight upper bound on the cover time for random walks on graphs. Random Structures and Algorithms, 6(1):51-54, 1995.
23. S. Hoory and A. Wigderson. Universal traversal sequences for expander graphs. Inf. Process. Lett., 46(2):67-69, 1993.
24. D. Kozen. Automata and planar graphs. In Proc. of Fundations Computatial Theory (FCT 79), pages 243-254, 1979.
25. P. Panaite and A. Pelc. Impact of topographic information on graph exploration efficiency. Networks, 36.
26. M.O. Rabin. Maze threading automata. Technical Report Seminar Talk, University of California at Berkeley, October 1967.
27. O. Reingold. Undirected st-connectivity in log-space. Electronic Colloquium on Computational Complexity, 94, 2004.
28. H.A. Rollik. Automaten in planaren graphen. Acta Informatica, 13:287-298, 1980.
29. N. Roo, S. Hareti, W. Shi, and S. Iyengar. Robot navigation in unknown terrains: Introductory survey of length,non-heuristic algorithms. Technical Report ORNL/TM12410, Oak Ridge National Lab., 1993.