Undirected connectivity in O(log/sup 1.5/n) space

The authors present a deterministic algorithm for the connectivity problem on undirected graphs that runs in O(log/sup 1.5/n) space. Thus, the recursive doubling technique of Savich (1970) which requires Theta (log/sup 2/n) space is not optimal for this problem.<<ETX>>

[1]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[2]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[3]  Stephen A. Cook,et al.  Space Lower Bounds for Maze Threadability on Restricted Machines , 1980, SIAM J. Comput..

[4]  Noam Nisan,et al.  Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.

[5]  Allan Borodin,et al.  Two Applications of Inductive Counting for Complementation Problems , 1989, SIAM J. Comput..

[6]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computations , 1990, STOC '90.

[7]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[8]  Walter L. Ruzzo,et al.  Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space. , 1991, STOC '91.

[9]  Donald B. Johnson,et al.  Connected components in O(lg/sup 3/2 mod V/ mod ) parallel time for the CREW PRAM , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[10]  Noam Nisan,et al.  Fast connected components algorithms for the EREW PRAM , 1992, SPAA '92.

[11]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[12]  Noam Nisan,et al.  RL⊆SC , 1992, STOC '92.