Exploring an Unknown Graph Efficiently

We study the problem of exploring an unknown, strongly connected directed graph. Starting at some node of the graph, we must visit every edge and every node at least once. The goal is to minimize the number of edge traversals. It is known that the competitive ratio of online algorithms for this problem depends on the deficiency d of the graph, which is the minimum number of edges that must be added to make the graph Eulerian. We present the first deterministic online exploration algorithm whose competitive ratio is polynomial in d (it is O(d8)).

[1]  Xiaotie Deng,et al.  How to learn an unknown environment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[2]  Xiaotie Deng,et al.  Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[3]  Stephen Kwek,et al.  On a Simple Depth-First Search Strategy for Exploring Unknown Graphs , 1997, WADS.

[4]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[5]  Michael A. Bender,et al.  The power of team exploration: two robots can learn unlabeled directed graphs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[7]  Rolf Klein,et al.  The Polygon Exploration Problem , 2001, SIAM J. Comput..

[8]  Susanne Albers,et al.  Exploring unknown environments , 1997, STOC '97.

[9]  Rudolf Fleischer,et al.  Experimental Studies of Graph Traversal Algorithms , 2003, WEA.

[10]  Gerhard J. Woeginger,et al.  Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

[11]  Heinrich Müller,et al.  Effiziente Methoden der geometrischen Modellierung und der wissenschaftlichen Visualisierung, Dagstuhl Seminar 1997 , 1999, Effiziente Methoden der geometrischen Modellierung und der wissenschaftlichen Visualisierung.

[12]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[13]  Mona Singh,et al.  Piecemeal Graph Exploration by a Mobile Robot , 1999, Inf. Comput..

[14]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[15]  Baruch Schieber,et al.  Navigating in unfamiliar geometric terrain , 1991, STOC '91.

[16]  Bala Kalyanasundaram,et al.  Constructing Competitive Tours from Local Information , 1994, Theor. Comput. Sci..

[17]  Christos H. Papadimitriou,et al.  On the complexity of edge traversing , 1976, J. ACM.

[18]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[19]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[20]  Amos Fiat,et al.  Online Navigation in a Room , 1992, J. Algorithms.

[21]  Klaus Jansen,et al.  Experimental and Efficient Algorithms , 2003, Lecture Notes in Computer Science.

[22]  Amos Fiat,et al.  Randomized robot navigation algorithms , 1996, SODA '96.

[23]  Xiaotie Deng,et al.  How to learn an unknown environment. I: the rectilinear case , 1998, JACM.