Tree exploration with logarithmic memory

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 585-594

  Gąsieniec, Leszek ^a   Pelc, Andrzej ^b   Radzik, Tomasz ^c   Zhang, Xiaohui ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

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

^c KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; MOBILE AGENTS; TREES (MATHEMATICS);

EDGE PORTS; LOWER BOUNDS; MEMORY SIZE; PRIORI KNOWLEDGE; UNDIRECTED CONNECTED GRAPHS;

GRAPH THEORY;

EID: 84969247968     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. S. Albers and M. R. Henzinger, Exploring unknown environments, SIAM Journal on Computing 29 (2000), 1164-1188.
2. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász and C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, Proc. 20th Ann. Symp. on Foundations of Computer Science (FOCS 1979), 218-223.
3. N. Alon, Y. Azar, and Y. Ravid, Universal sequences for complete graphs, Discrete Applied Mathematics 27 (1990), 25-28.
4. B. Awerbuch, M. Betke, R. Rivest and M. Singh, Piecemeal graph learning by a mobile robot, Proc. 8th Conf. on Comput. Learning Theory (1995), 321-328.
5. L. Babi, N. Nisan, and M. Szegedy, Multiparty protocols and logspace-hard pseudorandom sequences, Proc 21st Ann. ACM Symposium on Theory of Computing (STOC 1989), 1-11.
6. A. Bar-Noy, A. Borodin, M. Karchmer, N. Linial, and M. Werman, Bounds on universal sequences, SIAM J. Computing, 18 (1989), 268-277.
7. M.A. Bender, A. Fernandez, D. Ron, A. Sahai and S. Vadhan, The power of a pebble: Exploring and mapping directed graphs, Proc. 30th Ann. Symp. on Theory of Computing (STOC 1998), 269-278.
8. M.A. Bender and D. Slonim, The power of team exploration: Two robots can learn unlabeled directed graphs, Proc. 35th Ann. Symp. on Foundations of Computer Science (FOCS 1994), 75-85.
9. M. Betke, R. Rivest and M. Singh, Piecemeal learning of an unknown environment, Machine Learning 18 (1995), 231-254.
10. M. Bridgland, Universal traversal sequences for paths and cycles, Journal of Algorithms 8 (1987), 395-404.
11. J. Buss, and M. Tompa, Lower bounds on universal traversal sequences based on chains of length five, Information and Computation 120 (1995), 326-329.
12. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, D. Peleg, Label-guided graph exploration by a finite automaton, Proc. 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), LNCS 3580, 335-346.
13. X. Deng, T. Kameda and C. H. Papadimitriou, How to learn an unknown environment I: the rectilinear case, Journal of the ACM 45 (1998), 215-245.
14. X. Deng and C. H. Papadimitriou, Exploring an unknown graph, Journal of Graph Theory 32 (1999), 265-297.
15. K. Diks, P. Fraigniaud, E. Kranakis, A. Pelc, Tree exploration with little memory, Journal of Algorithms 51 (2004), 38-63.
16. C.A. Duncan, S.G. Kobourov and V.S.A. Kumar, Optimal constrained graph exploration, Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (2001), 807-814.
17. P. Fraigniaud, D. Ilcinkas, Digraphs exploration with little memory, Proc. 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS 2004), LNCS 2996, 246-257.
18. P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, D. Peleg, Graph exploration by a finite automaton, Theoretical Computer Science 345 (2005), 331-344.
19. P. Fraigniaud, D. Ilcinkas, S. Rajsbaum, S. Tixeuil, Space lower bounds for graph exploration via reduced automata, Proc. 12th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), LNCS 3499, 140-154.
20. S. Hoory, and A. Widgerson, Universal traversal sequences for expander graphs, Information Processing Letters, 46 (1993), 67-69.
21. R. Impagliazza, N. Nisan, A. Widgerson, Pseudoran-domness for network algorithms, Proc 26th Ann. ACM Symposium on Theory of Computing (STOC 1994), 356-364.
22. S. Istrail, Polynomial universal traversing sequences for cycles are constructible, Proc 20th Annual ACM Symposium on Theory of Computing (STOC 1988), 491-503.
23. log n for cliques, Information Processing Letters, 28 (1988), 241-243.
24. 4.03), Proc. Electronic Colloquium on Computational Complexity, Report TR01-13, http://www.eccc.uni-trier.de/eccc, 2001.
25. M. Koucký, Universal Traversal Sequences with Back-tracking, Proc. 16th IEEE Conference on Computational Complexity (2001), 21-26.
26. N. Nisan, Pseudorandom generators for space-bounded computation, Combinatorica, 12 (1992), 449-461.
27. P. Panaite and A. Pelc, Exploring unknown undirected graphs, Journal of Algorithms 33 (1999), 281-295.
28. O. Reingold, Undirected ST-connectivity in log-space, Proc 37th Annual ACM Symposium on Theory of Computing (STOC 1998), 376-385.