Lower bounds on the length of universal traversal sequences

Universal traversal sequences for <italic>d</italic>-regular <italic>n</italic>-vertex graphs require length &OHgr;(<italic>d</italic><supscrpt>2</supscrpt><italic>n</italic><supscrpt>2</supscrpt> + <italic>dn</italic><supscrpt>2</supscrpt> log <italic>n/d</italic>), for 3 ≤ <italic>d</italic> ≤ <italic>n</italic>/3 - 2. This is nearly tight for <italic>d</italic> = &THgr;(<italic>n</italic>). We also introduce and study several variations on the problem, e.g. edge-universal traversal sequences, showing how improved lower bounds on these would improve the bounds given above.

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

[2]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[3]  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).

[4]  Leonard M. Adleman,et al.  Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[5]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[6]  L. Lovász.  Combinatorial problems and exercises , 1979 .

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

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

[9]  Allan Borodin,et al.  A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation , 1982, SIAM J. Comput..

[10]  Rusins Freivalds,et al.  Probabilistic Machines Can Use Less Running Time , 1977, IFIP Congress.

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

[12]  Stephen A. Cook,et al.  Space Lower Bounds for Maze Threadability on Restricted Machines , 1980, SIAM J. Comput..

[13]  Baruch Awerbuch,et al.  A Tradeoff between Information and Communication in Broadcast Protocols , 1988, AWOC.

[14]  M. Newman,et al.  Topics in Algebra , 1978 .

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

[16]  Marc Snir,et al.  Lower Bounds on Probabilistic Linear Decision Trees , 1985, Theor. Comput. Sci..

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

[18]  Allan Borodin,et al.  Two Applications of Inductive Counting for Complementation Problems , 1989, SIAM J. Comput..

[19]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computations , 1990, STOC '90.

[20]  Michael O. Rabin,et al.  Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[21]  Eli Upfal,et al.  Trading space for time in undirected s-t connectivity , 1989, STOC '89.