Lower bounds on the length of universal traversal sequences

Authors:
A. Borodin;W. L. Ruzzo;M. Tompa
Affiliations:
Dept. of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 1A4;Dept. of Computer Science, FR-35, University of Washington, Seattle, Washington;IBM Research Division, Thomas J. Watson Research Center, P. 0. Box 218, Yorktown Heights, New York
Venue:
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Year:
1989

Citing 8
Cited 3

Universal traversal sequences for paths and cycles

Journal of Algorithms
Universal traversal sequences of length nO(log n) for cliques

Information Processing Letters
Polynomial universal traversing sequences for cycles are constructible

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Bounds on universal sequences

SIAM Journal on Computing
Two applications of inductive counting for complementation problems

SIAM Journal on Computing
Trading space for time in undirected s-t connectivity

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The electrical resistance of a graph captures its commute and cover times

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Universal sequences for complete graphs

Discrete Applied Mathematics - Computational combinatiorics

The electrical resistance of a graph captures its commute and cover times

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space.

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Universal traversal sequences for d-regular n-vertex graphs require length &OHgr;(d2n2 + dn2 log n/d), for 3 ≤ d ≤ n/3 - 2. This is nearly tight for d = &THgr;(n). 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.