论文信息 - Undirected Connectivity in O(l~gl*~ n) Space*

Undirected Connectivity in O(l~gl~ n) Space

We present a deterministic algorithm for the connectivity problem on undirected graphs that runs in O(l~g’.~ n) space. Thus, the recursive doubling technique of Savich which requires Q(log2 n) space is not optimal for this problem.

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

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

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

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

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