Impact of topographic information on graph exploration efficiency

Networks

Volumn 36, Issue 2, 2000, Pages 96-103

  Panaite, Petrişor ^a   Pelc, Andrzej ^a  

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

Author keywords

Algorithm; Exploration; Graph; Knowledge; Traversal

Indexed keywords

EID: 0034259971     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200009)36:2<96::AID-NET4>3.0.CO;2-N     Document Type: Article

References (17)

1. [1] S. Albers and M. R. Henzinger, Exploring unknown environments, Proc 29th Symp on Theory of Computing, 1997, pp. 416-425.
2. [2] B. Awerbuch, M. Betke, R. Rivest, and M. Singh, Piecemeal graph learning by a mobile robot, Proc 8th Conf on Computer Learning Theory, 1995, pp. 321-328.
3. [3] E. Bar-Eli, P. Berman, A. Fiat, and R. Yan, On-line navigation in a room, Proc 3rd ACM-SIAM Symp on Discrete Algorithms, 1992, pp. 237-249.
4. [4] P. Berman, A. Blum, A. Fiat, H. Karloff, A. Rosen, and M. Saks, Randomized robot navigation algorithms, Proc 7th ACM-SIAM Symp on Discrete Algorithms, 1996, pp. 74-84.
5. [5] M. Betke, R. Rivest, and M. Singh, Piecemeal learning of an unknown environment, Proc 5th Conf on Computer Learning Theory, 1993, pp. 277-286.
6. [6] A. Blum, P. Raghavan, and B. Schieber, Navigating in unfamiliar geometric terrain, Proc 23rd Symp on Theory of Computing, 1991, pp. 494-504.
7. [7] X. Deng, T. Kameda, and C. H. Papadimitriou, How to learn an unknown environment, Proc 32nd Symp on Foundations of Computer Science, 1991, pp. 298-303.
8. [8] X. Deng and C. H. Papadimitriou, Exploring an unknown graph, Proc 31st Symp on Foundations of Computer Science, 1990, pp. 356-361.
9. [9] K. Diks, E. Kranakis, and A. Pelc, Broadcasting in unlabeled tori, Par Proc Lett 8 (1998), 177-188.
10. [10] K. Diks, E. Kranakis, and A. Pelc, Perfect broadcasting in unlabeled networks, Discr Appl Math 87 (1999), 33-47.
11. [11] K. Diks, S. Dobrev, E. Kranakis, A. Pelc, and P. Ruzicka, Broadcasting in unlabeled hypercubes with linear number of messages, Info Process Lett 66 (1998), 181-186.
12. [12] F. Hoffmann, C. Icking, R. Klein, and K. Kriegel, A competitive strategy for learning a polygon, Proc 8th ACM-SIAM Symp on Discrete Algorithms, 1997, pp. 166-174.
13. [13] P. Panaite and A. Pelc, Exploring unknown undirected graphs, J Alg 33 (1999), 281-295.
14. [14] C. H. Papadimitriou and M. Yannakakis, Shortest paths without a map, Theor Comput Sci 84 (1991), 127-150.
15. [15] N. S. V. Rao, S. Hareti, W. Shi, and S. S. Iyengar, Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms, Technical report ORNL/TM-12410, Oak Ridge National Laboratory, July 1993.
16. [16] N. Santoro, Sense of direction, topological awareness, and communication complexity, ACM SIGACT News 16 (1984), 50-56.
17. [17] D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Commun ACM 28 (1985), 202-208.