A Spectrum of Time - Space Trade-offs for Undirected s-t Connectivity

Journal of Computer and System Sciences

Volumn 54, Issue 2, 1997, Pages 305-316

  Feige, Uriel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; RANDOM PROCESSES;

TIME SPACE TRADE OFFS;

ALGORITHMS;

EID: 0031119285     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1471     Document Type: Article

References (15)

1. D. J. Aldous, Reversible Markov chains and random walks on graphs, draft of first six chapters of book, January 26, 1993.
2. 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, 20th Annual Symposium on Foundations of Computer Science," pp. 218-223, San Juan, Puerto Rico, October 1979.
3. G. Barnes and U. Feige, Short random walks on graphs, SIAM J. Discrete Math. 9, No. 1 (1996), 19-28. Some results cited appear only in the preliminary version, "Proceedings, 25th Symposium of the Theory of Computing, 1993," pp. 728-737.
4. G. Barnes and U. Feige, Short random walks on graphs, SIAM J. Discrete Math. 9, No. 1 (1996), 19-28. Some results cited appear only in the preliminary version, "Proceedings, 25th Symposium of the Theory of Computing, 1993," pp. 728-737.
5. P. Beame, A. Borodin, P. Raghavan, W. Ruzzo, and M. Tompa, Time-space trade-offs for undirected graph traversal, in "Proceedings 31st Annual Symposium on Foundations of Computer Science, St. Louis, MO, October 1990," pp. 429-438.
6. A. Borodin, S. Cook, P. Dymond, W. Ruzzo, and M. Tompa, Two applications of inductive counting for complementation problems, SIAM J. Comput. 18, No. 3 (1989), 559-578.
7. A. Z. Broder, A. R. Karlin, P. Raghavan, and E. Upfal, Trading space for time in undirected s-t connectivity, SIAM J. Comput. 23 (1994), 324-334.
8. A. Chandra, P. Raghavan, W. Ruzzo, R. Smolensky, and P. Tiwari, The electrical resistance of a graph captures its commute and cover times, in "Proceedings, of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, WA, May 1989," pp. 574-586.
9. D. Coppersmith, U. Feige, and J. Shearer, Random walks on regular and irregular graphs, SIAM J. Discrete Math. 9, No. 2 (1996), 301-308.
10. P. G. Doyle and J. L. Snell, "Random Walks and Electrical Networks," Math. Assoc. Amer., Washington, DC, 1984.
11. J. Edmonds, Time-Space trade-offs for undirected ST-connectivity on a JAG, in "Proc. of 25th Symposium of the Theory of Computing, 1993," pp. 718-727.
12. U. Feige, A fast randomized logspace algorithm for graph connectivity, in "ICALP94 Proceedings," Lecture Notes in Computer Science, Vol. 820, pp. 499-507, Springer-Verlag, New York/Berlin, 1994.
13. J. D. Kahn, N. Linial, N. Nisan, and M. E. Saks, On the cover time of random walks on graphs, J. Theoret. Probab. 2, No. 1 (1989), 121-128.
14. W. L. Ruzzo, Lecture Notes for CS 533, unpublished, University of Washington, 1989.
15. P. Tetali, Random walks and the effective resistance of networks, J. Theoret. Probab. 4 (1991), 101-109.