Universal traversal sequences with backtracking

Journal of Computer and System Sciences

Volumn 65, Issue 4, 2002, Pages 717-726

  Koucký, Michal ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES; TREES (MATHEMATICS);

BACKTRACKING; EXPLORATION SEQUENCES; LOWER BOUNDS; TRAVERSAL SEQUENCES;

COMPUTER SCIENCE;

EID: 23844524168     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00023-5     Document Type: Conference Paper

References (23)

1. [A] R. Aleliunas, A simple graph traversing problem, Master's Thesis, University of Toronto, 1978 (Technical Report 20).
2. [AKLLR] 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: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1979, pp. 218-223.
3. [AAR] N. Alon, Y. Azar, Y. Ravid, Universal sequences for complete graphs, Discrete Appl. Math. 27 (1990) 25-28.
4. 4/3, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM, New York, NY, 1997, pp. 230-239.
5. [BNS] L. Babai, N. Nisan, M. Szegedy, Multiparty protocols and logspace-hard pseudorandom sequences (extended abstract), in: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, ACM, New York, NY, 1989, pp, 1-11.
6. [BBKLW] A. Bar-Noy, A. Borodin, M. Karchmer, N. Linial, M. Werman, Bounds on universal sequences, SIAM J. Comput. 18 (2) (1989) 268-277.
7. [BRT] A. Borodin, W.L. Ruzzo, M. Tompa, Lower bounds on the length of traversal sequences, J. Comput. Syst. Sci. 45 (2) (1992) 180-203.
8. [B] M.F. Bridgland, Universal traversal sequences for paths and cycles, J. Algorithms 8 (3) (1987) 395-404.
9. [BT] J. Buss, M. Tompa, Lower bounds on universal traversal sequences based on chains of length five, Inform. Comput. 120 (2) (1995) 326-329.
10. [CRRST] A.K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, P. Tiwari, The electrical resistance of a graph captures its commute and cover times, in: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, ACM, New York, NY, 1989, pp. 574-586.
11. [D] H.K. Dai, Optimizing a computational method for length lower bounds for reflecting sequences, in: Proceedings of "The 7th Annual International Computing and Combinatorics Conference," Lecture Notes in Computer Science, Vol. 2108, Springer, Berlin, 2001, pp. 228-236.
12. [HW] S. Hoory, A. Wigderson, Universal traversal sequences for expander graphs, Inform. Process. Lett. 46 (2) (1993) 67-69.
13. [INW] R. Impagliazzo, N. Nisan, A. Wigderson, Pseudorandomness for network algorithms, in: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, ACM, New York, NY, 1994, pp. 356-364.
14. [IM] D.L. Isaacson, R.W. Madsen, Markov Chains, Theory and Applications, Wiley, New York, 1976.
15. [I] S. Istrail, Polynomial universal traversing sequences for cycles are constructible (extended abstract), in: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, ACM, New York, NY, 1988, pp. 491-503.
16. [KLNS] J.D. Kahn, N. Linial, N. Nisan, M.E. Saks, On the cover time of random walks on graphs, J. Theor. Probab. 2 (1) (1989) 121-128.
17. O(log n) for cliques, Inform. Process. Lett. 28 (5) (1988) 241-243.
18. 4.03), Theoret. Comput. Sci., to appear.
19. (Extended abstract appeared in proceedings of "The 7th Annual International Computing and Combinatorics Conference," Lecture Notes in Computer Science, Vol. 2108, Springer, Berlin, 2001, pp. 11-20.)
20. [N] N. Nisan, Pseudorandom generators for space-bounded computation, Combinatorica 12 (4) (1992) 449-461.
21. 1.5 n) space, in: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 24-29.
22. 3/2), in: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 344-353.
23. [T] M. Tompa, Lower bounds on universal traversal sequences for cycles and other low degree graphs, SIAM J. Comput. 21 (6) (1992) 1153-1160.