Undirected connectivity in log-space


We present a <i>deterministic</i>, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log<sup>4/3</sup>(&#7777;) obtained by Armoni, Ta-Shma, Wigderson and Zhou (JACM 2000). As undirected st-connectivity is complete for the class of problems solvable by symmetric, nondeterministic, log-space computations (the class SL), this algorithm implies that SL &equals; L (where L is the class of problems solvable by deterministic log-space computations). Independent of our work (and using different techniques), Trifonov (STOC 2005) has presented an <i>O</i>(log <i>n</i> log log <i>n</i>)-space, deterministic algorithm for undirected st-connectivity. Our algorithm also implies a way to construct in log-space a <i>fixed</i> sequence of directions that guides a deterministic walk through all of the vertices of any connected graph. Specifically, we give log-space constructible universal-traversal sequences for graphs with restricted labeling and log-space constructible universal-exploration sequences for general graphs.

DOI: 10.1145/1391289.1391291

Extracted Key Phrases

1 Figure or Table

Citations per Year

363 Citations

Semantic Scholar estimates that this publication has 363 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Reingold2008UndirectedCI, title={Undirected connectivity in log-space}, author={Omer Reingold}, journal={J. ACM}, year={2008}, volume={55}, pages={17:1-17:24} }