Log-space constructible universal traversal sequences for cycles of length O(n4.03)

Theoretical Computer Science

Volumn 296, Issue 1, 2003, Pages 117-144

  Koucký, Michal ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING;

UNIVERSAL TRAVERSAL SEQUENCES;

COMPUTER SCIENCE;

EID: 0037269032     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00436-X     Document Type: Conference Paper

References (12)

1. R. Aleliunas, A simple graph traversing problem, Master's Thesis, University of Toronto, 1978 (Technical Report 20).
2. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: 20th Annu. Symp. on Foundations of Computer Science, 1979, pp. 218-223.
3. 4/3, in: Proc. 29th Annu. ACM Symp. on Theory of Computing, 1997, pp. 230-239.
4. Bar-Noy A., Borodin A., Karchmer M., Linial N., Werman M. Bounds on universal sequences. SIAM J. Comput. 18(2):1989;268-277.
5. Bridgland M.F. Universal traversal sequences for paths and cycles. J. Algorithms. 8(3):1987;395-404.
6. H.K. Dai, Optimizing a computational method for length lower bounds for reflecting sequences, in: Proc. 7th Annu. Internat. Computing and Combinatorics Conf., Lecture Notes in Computer Science, vol. 2108, 2001, pp. 228-236.
7. Hoory S., Wigderson A. Universal traversal sequences for expander graphs. Inform. Process. Lett. 46(2):1993;67-69.
8. S. Istrail, Polynomial universal traversing sequences for cycles are constructible (extended abstract), in: Proc. 20th Annu. ACM Symp. on Theory of Computing, 1988, pp. 491-503.
9. O(log n) for cliques Inform. Process. Lett. 28(5):1988;241-243.
10. M. Koucký, Universal traversal sequences with backtracking, in: Proc. 16th Annu. IEEE Conf. on Computational Complexity, 2001, pp. 21-27.
11. Nisan N. Pseudorandom generators for space-bounded computation. Combinatorica. 12(4):1992;449-461.
12. 1.5 n) space, in: Proc. 33rd Annu. Symp. on Foundations of Computer Science, 1992, pp. 24-29.