Optimizing a computational method for length lower bounds for reflecting sequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2108, Issue , 2001, Pages 228-236

  Dai, H K ^a  

^a Oklahoma State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENUMERATION METHOD; LOWER BOUNDS; QUAD TREES; REGULAR GRAPHS; TRAVERSAL SEQUENCES; VERTEX PAIRS;

GRAPH THEORY;

EID: 23044530331     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_25     Document Type: Conference Paper

References (9)

1. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science, pages 218–223. IEEE Computer Society, October 1979.
2. P. Beame, A. Borodin, P. Raghavan, W. L. Ruzzo, and M. Tompa. Time-space tradeoffs for undirected graph traversal. In Proceedings of the 31st IEEE Symposium on the Foundations of Computer Science, pages 429–438. IEEE Computer Society, October 1990.
3. A. Bar-Noy, A. Borodin, M. Karchmer, N. Linial, and M. Werman. Bounds on universal sequences. SIAM Journal on Computing, 18(2):268–277, 1989.
4. A. Borodin, W. L. Ruzzo, and M. Tompa. Lower bounds on the length of universal traversal sequences. In Proceedings of the Twenty-First ACM Symposium on the Theory of Computing, pages 562–573. Association for Computing Machinery, May 1989.
5. J. Buss and M. Tompa. Lower bounds on universal traversal sequences based on chains of length five. Information and Computation, 120(2):326–329, 1995.
6. S. A. Cook and C. W. Rackoff. Space lower bounds for maze threadability on restricted machines. SIAM Journal on Computing, 9(3):636–652, 1980.
7. A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times. In Proceedings of the Twenty-First ACM Symposium on the Theory of Computing, pages 574–586. Association for Computing Machinery, May 1989.
8. H. K. Dai and K. E. Flannery. Improved length lower bounds for reflecting sequences. In J.-Y. Cai and C. K. Wong, editors, Lecture Notes in Computer Science (1090): Computing and Combinatorics, pages 56–67, Springer-Verlag, Berlin Heidelberg, 1996.
9. M. Tompa. Lower bounds on universal traversal sequences for cycles and other low degree graphs. SIAM Journal on Computing, 21(6):1153–1160, 1992.