Universal traversal sequences with backtracking

We introduce a new notion of traversal sequences that we call exploration sequences. Exploration sequences share many properties with the traversal sequences defined in (AKL+), but they also exhibit some new properties. In particular, they have an ability to backtrack, and their random properties are robust under choice of the probability distribution on labels. Further, we present extremely simple constructions of polynomial length universal exploration sequences for some previously studied classes of graphs (e.g. 2-regular graphs, cliques, expanders), and we also present universal exploration sequences for trees. Our constructions beat previously known lower-bounds on the length of universal traversal sequences.

[1]  N. Linial,et al.  On the cover time of random walks on graphs , 1989 .

[2]  Allan Borodin,et al.  Lower Bounds on the Length of Universal Traversal Sequences , 1992, J. Comput. Syst. Sci..

[3]  Howard J. Karloff,et al.  Universal Traversal Sequences of Length n^O(log n) for Cliques , 1988, Inf. Process. Lett..

[4]  Avi Wigderson,et al.  Universal Traversal Sequences for Expander Graphs , 1993, Inf. Process. Lett..

[5]  Martin Tompa.  Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs , 1992, SIAM J. Comput..

[6]  Michael F. Bridgland.  Universal Traversal Sequences for Paths and Cycles , 1987, J. Algorithms.

[7]  H. K. Dai.  Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences , 2001, COCOON.

[8]  Sorin Istrail,et al.  Polynomial universal traversing sequences for cycles are constructible , 1988, STOC '88.

[9]  Allan Borodin,et al.  Bounds on Universal Sequences , 1989, SIAM J. Comput..

[10]  Noga Alon,et al.  Universal sequences for complete graphs , 1990, Discret. Appl. Math..

[11]  Prabhakar Raghavan,et al.  The electrical resistance of a graph captures its commute and cover times , 1989, STOC '89.

[12]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[13]  Noam Nisan,et al.  Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract) , 1989, Symposium on the Theory of Computing.

[14]  Avi Wigderson,et al.  SL ⊆L4/3 , 1997, STOC 1997.

[15]  Noam Nisan,et al.  Pseudorandomness for network algorithms , 1994, STOC '94.

[16]  Michal Koucký.  Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03) , 2001, COCOON.

[17]  Martin Tompa,et al.  Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five , 1995, Inf. Comput..

[18]  Dean Isaacson,et al.  Markov Chains: Theory and Applications , 1976 .

[19]  Noam Nisan,et al.  Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.

[20]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).