Optimal graph exploration without good maps

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 374-386

  Sweden, Anders Dessmark ^a   Pelc, Andrzej ^b  

^a LUND INSTITUTE OF TECHNOLOGY   (Sweden)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EDGE TRAVERSAL; EXPLORATION ALGORITHMS; LOWER BOUNDS; OPTIMAL ALGORITHM; OPTIMAL GRAPHS; OPTIMALITY; UNDIRECTED CONNECTED GRAPHS;

GRAPH THEORY;

EID: 84938095433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. S. Albers and M. R. Henzinger, Exploring unknown environments, SIAM Journal on Computing 29 (2000), 1164-1188. 376
2. 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. 376
3. E. Bar-Eli, P. Berman, A. Fiat and R. Yan, On-line navigation in a room, Journal of Algorithms 17 (1994), 319-341. 376
4. M. A. Bender, A. Fernandez, D. Ron, A. Sahai and S. Vadhan, The power of a pebble: Exploring and mapping directed graphs, STOC 98, 269-278. 376
5. M. A. Bender and D. Slonim, The power of team exploration: Two robots can learn unlabeled directed graphs, FOCS 94, 75-85. 376
6. A. Blum, P. Raghavan and B. Schieber, Navigating in unfamiliar geometric terrain, SIAM Journal on Computing 26 (1997), 110-137. 376
7. M. Betke, R. Rivest and M. Singh, Piecemeal learning of an unknown environment, Machine Learning 18 (1995), 231-254. 376
8. 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. 376
9. X. Deng and C. H. Papadimitriou, Exploring an unknown graph, Journal of Graph Theory 32 (1999), 265-297. 376
10. K. Diks, P. Fraigniaud, E. Kranakis, A. Pelc, Tree exploration with little memory, SODA 2002, San Francisco, U. S. A., January 2002. 376
11. C. A. Duncan, S. G. Kobourov and V. S. A. Kumar, Optimal constrained graph exploration, SODA 2001, 807-814. 376
12. P. Panaite and A. Pelc, Exploring unknown undirected graphs, Journal of Algorithms 33 (1999), 281-295. 376
13. P. Panaite, A. Pelc, Impact of topographic information on graph exploration efficiency, Networks, 36 (2000), 96-103. 376, 384, 385
14. N. S. V. Rao, S. Hareti, W. Shi and 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. 376