Tree exploration with little memory

Journal of Algorithms

Volumn 51, Issue 1, 2004, Pages 38-63

  Diks, Krzysztof ^a   Fraigniaud, Pierre ^b   Kranakis, Evangelos ^c   Pelc, Andrzej ^d  

^a UNIVERSITY OF WARSAW   (Poland)

^b CNRS   (France)

^c CARLETON UNIVERSITY   (Canada)

^d UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

Graph exploration; Universal traversal sequences

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; ROBOTICS; THEOREM PROVING; TOPOLOGY;

GRAPH EXPLORATION; UNIVERSAL TRAVERSAL SEQUENCES;

TREES (MATHEMATICS);

EID: 1842612563     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2003.10.002     Document Type: Article

References (25)

1. S. Albers, M.R. Henzinger, Exploring unknown environments, SIAM J. Comput. 29 (2000) 1164-1188.
2. N. Alon, Y. Azar, Y. Ravid, Universal sequences for complete graphs, Discrete Appl. Math. 27 (1990) 25-28.
3. B. Awerbuch, M. Betke, R. Rivest, M. Singh, Piecemeal graph learning by a mobile robot, in: Proc. 8th Conf. on Comput. Learning Theory, 1995, pp. 321-328.
4. L. Babi, N. Nisan, M. Szegedy, Multiparty protocols and logspace-hard pseudorandom sequences, in: Proc. 21st Annual ACM Symposium on Theory of Computing (STOC), 1989, pp. 1-11.
5. E. Bar-Eli, P. Berman, A. Fiat, R. Yan, On-line navigation in a room, J. Algorithms 17 (1994) 319-341.
6. A. Bar-Noy, A. Borodin, M. Karchmer, N. Linial, M. Werman, Bounds on universal sequences, SIAM J. Comput. 18 (2) (1989) 268-277.
7. M.A. Bender, A. Fernandez, D. Ron, A. Sahai, S. Vadhan, The power of a pebble: exploring and mapping directed graphs, in: Proc. 30th Annual Symposium on Theory of Computing, 1998, pp. 269-278.
8. M.A. Bender, D. Slonim, The power of team exploration: two robots can learn unlabeled directed graphs, in: Proc. 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 75-85.
9. A. Blum, P. Raghavan, B. Schieber, Navigating in unfamiliar geometric terrain, SIAM J. Comput. 26 (1997) 110-137.
10. M. Betke, R. Rivest, M. Singh, Piecemeal learning of an unknown environment, Machine Learning 18 (1995) 231-254.
11. M. Bridgland, Universal traversal sequences for paths and cycles, J. Algorithms 8 (3) (1987) 395-404.
12. J. Buss, M. Tompa, Lower bounds on universal traversal sequences based on chains of length five, Inform. and Comput. 120 (2) (1995) 326-329.
13. X. Deng, T. Kameda, C.H. Papadimitriou, How to learn an unknown environment, I: The rectilinear case, J. ACM 45 (1998) 215-245.
14. X. Deng, C.H. Papadimitriou, Exploring an unknown graph, J. Graph Theory 32 (1999) 265-297.
15. C.A. Duncan, S.G. Kobourov, V.S.A. Kumar, Optimal constrained graph exploration, in: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 807-814.
16. S. Hoory, A. Widgerson, Universal traversal sequences for expander graphs, Inform. Process. Lett. 46 (2) (1993) 67-69.
17. R. Impagliazza, N. Nisan, A. Widgerson, Pseudorandomness for network algorithms, in: Proc. 26th Annual ACM Symposium on Theory of Computing (STOC), 1994, pp. 356-364.
18. S. Istrail, Polynomial universal traversing sequences for cycles are constructible, in: Proc. 20th Annual ACM Symposium on Theory of Computing (STOC), 1988, pp. 491-503.
19. log n for cliques, Inform. Process. Lett. 28 (5) (1988) 241-243.
20. 4.03), in: Proc. Electronic Colloquium on Computational Complexity, Report TR01-13, 2001, http://www.eccc.uni-trier.de/eccc.
21. M. Koucky, Universal traversal sequences with backtracking, in: Proc. 16th IEEE Conference on Computational Complexity, 2001, pp. 21-26; J. Comput. System Sci., submitted for publication.
22. M. Koucky, Universal traversal sequences with backtracking, in: Proc. 16th IEEE Conference on Computational Complexity, 2001, pp. 21-26; J. Comput. System Sci., submitted for publication.
23. N. Nisan, Pseudorandom generators for space-bounded computation, Combinatorica 12 (4) (1992) 449-461.
24. P. Panaite, A. Pelc, Exploring unknown undirected graphs, J. Algorithms 33 (1999) 281-295.
25. N.S.V. Rao, S. Hareti, W. Shi, S.S. Iyengar, Robot navigation in unknown terrains: introductory survey of non-heuristic algorithms, Tech. Report ORNL/TM-12410, Oak Ridge National Laboratory, July 1993.