Exploring an unknown graph

Journal of Graph Theory

Volumn 32, Issue 3, 1999, Pages 265-297

  Deng, Xiaotie ^a   Papadimitriou, Christos H ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Directed graphs; Graphs; On line algorithms; Search

Indexed keywords

EID: 0033462681     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8     Document Type: Article

References (19)

1. S. Albers and M. R. Henzinger, Exploring unknown environments, Proc 29th Ann ACM Symp Theory of Computing (STOC97), pp. 416-425.
2. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson, On the power of randomization in online algorithms, Algorith 11 (1994), 2-14.
3. R. A. Baeza-Yates, J. C. Culberson, and G. J. E. Rawlins, Searching in the Plane, Info Comp 106 (1993), 234-252.
4. G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, Robotic exploration as graph construction, IEEE Trans Robotics Automat 7 (1991), 859-865.
5. X. Deng, T. Kameda, and C. Papadimitriou, How to learn an unknown environment I: The rectilinear case, JACM 45 (1998), 215-245.
6. X. Deng and C. Papadimitriou, Exploring an unknown graph, IEEE 31st Ann Symp Found Comp Sci, 1990, pp. 355-361.
7. J. Edmonds and E. L. Johnson, Matching, Euler tours, and the Chinese postman, Math Prog 5 (1973), 88-124.
8. M. Guan, Graphic programming using odd or even points, Chinese Math 1 (1962), 273-277.
9. B. Kuipers and Y. Byun, A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations, Robot Auton Sys 8 (1991), 47-63.
10. B. Kuipers and T. S. Levitt, Navigation and mapping in large scale space, AI Mag 9 (1988), 25-43.
11. A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator, Competitive Snoopy caching, Algorith 3 (1988), 79-119.
12. E. Koutsoupias, private communication.
13. S. Kwek, On a simple depth-first search strategy for exploring unknown graphs, Proc 6th Inter Workshop Algorith Data Struct (WADS97), Halifax, 1997, pp. 345-353.
14. T. S. Levitt and D. T. Lawton, Qualitative navigation for mobile robots, Art Intel 44 (1990), 305-360.
15. M. S. Manasse, L. A. McGeoch, and D. D. Sleator, Competitive algorithms for on-line problems, J Algorith 11 (1990), 208-230.
16. P. Panaite and A. Pelc, Exploring unknown undirected graphs, Proc Ninth Ann ACM-SIAM Symp Discr Alg (SODA98), pp. 316-322.
17. C. Papadimitriou and M. Yannakakis, Shortest paths without a map, Theo Comp Sci 84 (1991), 127-150.
18. R. L. Rivest and R. E. Schapire, Inference of finite automata using homing sequences, Info Comp 103 (1993), 299-347.
19. D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Comm ACM 28 (1985), 202-208.