An O(Iog(n)4/3) Space Algorithm for (s, t) Connectivity in Undirected Graphs

Journal of the ACM

Volumn 47, Issue 2, 2000, Pages 294-311

  Armoni, Roy ^a,b,c   Ta Shma, Amnon ^a,b,c   Wigderson, Avi ^a,b,c   Zhou, Shiyu ^a,b,c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Computational complexity; Derandomization; Short pseudorandom walks on graphs; Space bounded computations; Undirected graph connectivity

Indexed keywords

DERANDOMIZATION; SPACE BOUNDED COMPUTATIONS; UNDIRECTED GRAPH CONNECTIVITY;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBABILITY; PROBLEM SOLVING; SET THEORY; STATISTICAL METHODS; THEOREM PROVING;

ALGORITHMS;

EID: 0005302745     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/333979.333984     Document Type: Article

References (11)

1. ALELIUNAS, R., KARP, R. M., LIPTON, R. J., LovAsz, L., AND RACKOFF, C. 1979. Random walks, universal traversal sequences, and the complexity of maze problems. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science (San Juan, Puerto Rico, Oct. 29-31). IEEE, Computer Society Press, Los Alamitos, Calif., pp. 218-223.
2. BARNES, G., AND FEIGE, U. 1996. Short random walks on graphs. SIAM J. Disc. Math. 9, 1 (Feb.), 19-28.
3. BELLARE, M., GOLDREICH, O., AND GOLDWASSER, S. 1993. Randomness in interactive proofs. Compiitat. Complex. 3, 4, 319-354.
4. BELLARE, M. AND ROMPEL, J. 1994. Randomness-efficient oblivious sampling. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (Los Alamitos, Calif., Nov. 1994), S. Goldwasser, Ed., IEEE Computer Society Press, Los Alamitos, Calif., pp'. 276-287.
5. LEWIS, H. R. AND PAPADIMITRIOU, C. H. 1982. Symmetric space-bounded computation. Theoret. Comput. Set. 19, 2 (Aug.), 161-187.
6. NISAN, N. 1992. Pseudorandom generators for space-bounded computation. Combinatorica 12, 4, 449-461.
7. NISAN, N. 1994. RL C SC. Compiitat. Complex. 4, 1, 1-11.
8. NISAN, N., SZEMEREDI, E., AND WIGDERSON, A. 1992. Undirected connectivity in O(/og1-5/i) space. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (Pittsburgh, Pa. Oct.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 24-29.
9. SAKS AND ZHOU, S. 1999. BP, SPACE(S) çDSPACE(S3'2). J. Comput. Syst. Sei. 58.
10. SAVITCH, W. J. 1970. Relationships between nondeterministic and deterministic tape complexities. J. Compiit. Syst. Sei. 4, 2 (Apr.), 177-192.
11. ZUCKERMAN, D. 1996. Randomness-optimal sampling, extractors, and constructive leader election. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 286-295.