A fast randomized LOGSPACE algorithm for graph connectivity

Theoretical Computer Science

Volumn 169, Issue 2, 1996, Pages 147-160

  Feige, Uriel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; ERRORS; GRAPH THEORY; POLYNOMIALS; PROBABILITY; STATISTICAL METHODS;

GRAPH CONNECTIVITY; RANDOM WALK PROBLEM; UNDIRECTED GRAPH REACHABILITY;

COMPUTATION THEORY;

EID: 0030571371     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00118-1     Document Type: Article

References (14)

1. D.J. Aldous, Reversible Markov chains and random walks on graphs, Draft of first six chapters of book, 26 January, 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: 20th FOCS (1979) 218-223.
3. G. Barnes and U. Feige, Short random walks on graphs, SIAM J. Discrete Math. 9 (1996) 19-28.
4. A. Borodin, S. Cook, P. Dymond, W. Ruzzo and M. Tompa, Two applications of inductive counting for complementation problems, SIAM J. Comput. 18 (1989) 559-578.
5. L. Carter and M. Wegman, Universal Hash functions, JCCS 18 (1979) 145-154.
6. D. Coppersmith, U. Feige and J. Shearer, Random walks on regular and irregular graphs, SIAM J. Discrete Math. 9 (1996) 301-308.
7. P.G. Doyle and J.L. Snell, Random walks and electrical networks, Math. Assoc. Amer., 1984.
8. U. Feige, A randomized time-space tradeoff of Õ(mR̂) for USTCON, in: 34th FOCS (1993) 238-246.
9. U. Feige, D. Peleg, P. Raghavan and E. Upfal, Computing with noisy information, SIAM J. Comput. 23 (1994) 1001-1018.
10. D. Gillman, A Chernoff bound for random walks on expander graphs, in: 34th FOCS (1993) 680-691.
11. S. Ross, Applied Probability Models with Optimization Applications (Holden-Day, San Francisco, CA, 1970).
12. M. Sipser, A complexity theoretic approach to randomness, in: 15th STOC (1983) 330-335.
13. P. Tetali, Random walks and the effective resistance of networks, J. Theoret. Probab. 4 (1991) 101-109.
14. 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, 1989) 574-586.