# Undirected connectivity in log-space

@article{Reingold2008UndirectedCI,
title={Undirected connectivity in log-space},
author={Omer Reingold},
journal={J. ACM},
year={2008},
volume={55},
pages={17:1-17:24}
}
• O. Reingold
• Published 1 September 2008
• Computer Science
• J. ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4/3(ṡ) 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 = L (where L is the class of problems solvable by deterministic log-space…
508 Citations

## Figures from this paper

On the Problem of Undirected st-connectivity
• Computer Science, Mathematics
ArXiv
• 2022
It is shown that undirected st-connectivity is within the L complexity class, problems solvable by deterministic Turing machines in logarithmic space.
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space
• Computer Science, Mathematics
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
We give a deterministic \tilde{O}(\log n)-space algorithm for approximately solving linear systems given by Laplacians of undirected graphs, and consequently also approximating hitting times, commute
S-T Connectivity on Digraphs with a Known Stationary Distribution
• Mathematics, Computer Science
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
• 2007
This work identifies knowledge of the stationary distribution as the gap between the S-T CONNECTIVITY problems the authors know how to solve in logspace and those that capture all of randomized logspace (RL).
S-T Connectivity on Digraphs with a Known Stationary Distribution
• Mathematics, Computer Science
Computational Complexity Conference
• 2007
This work identifies knowledge of the stationary distribution as the gap between the S-T CONNECTIVITY problems the authors know how to solve in logspace and those that capture all of randomized logspace (RL).
Faster walks in graphs: a Õ ( n 2 ) time-space trade-off for undirected s-t connectivity
A family of randomized algorithms for USTCON is proposed which achieves a time-space product of S · T = O(n2) in graphs with n nodes and m edges (where the O-notation disregards poly-logarithmic terms).
A Õ (n2) Time-Space Trade-off for Undirected s-t Connectivity
An algorithm running in time $\tilde O(n+m)$ which is, in general, more space-efficient than both BFS and DFS is obtained, and fine-tune the Metropolis-type walk so as to match the performance parameters of the unbiased random walk for any graph.
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
• Computer Science, Mathematics
2010 IEEE 25th Annual Conference on Computational Complexity
• 2010
A new ‘source-based’ structural decomposition method is presented that shows that reachability for planar DAGs with m sources can be decided deterministically in O(m+log n) space, which leads to a log-space algorithm for reachability in planars with O( log n) sources.
Realizable Paths and the NL vs L Problem
• S. Kintali
• Computer Science, Mathematics
Electron. Colloquium Comput. Complex.
• 2010
This thesis studies the space complexity of SGSLogCFL, a graph realizability problem lying between L and LogCFL and defines generalizations of graph squaring and transitive closure, and uses the techniques of Trifonov to show that SGSLowCFL is contained in DSPACE(lognloglog n).
Formulas vs. circuits for small distance connectivity
Half of the proof shows that bounded-depth formulas solving Distance k(n) Connectivity imply upper bounds on pathset complexity, which roughly speaking measures the minimum cost of constructing a set of (partial) paths in a universe of size n via the operations of union and relational join, subject to certain density constraints.
High-precision Estimation of Random Walks in Small Space
• Mathematics, Computer Science
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
• 2020
In this paper, we provide a deterministic $\tilde{O}(\log N)$-space algorithm for estimating random walk probabilities on undirected graphs, and more generally Eulerian directed graphs, to within

## References

SHOWING 1-10 OF 97 REFERENCES
Undirected ST-connectivity in log-space
A deterministic, log-space algorithm that solves st-connectivity in undirected graphs and implies a way to construct in log- space a fixed sequence of directions that guides a deterministic walk through all of the vertices of any connected graph.
RL⊆SC
• N. Nisan
• Computer Science, Mathematics
STOC '92
• 1992
There exists a deterministic algorithm for the undirected connectivity problem that runs in polynomial time and 0(log2 n) space, obtained by derandomizing the randomized algorithm of [AKL*79], and the de-randomization result is obtained.
An O(log n log log n) space algorithm for undirected st-connectivity
We present a deterministic O(log n log log n) space algorithm for undirected st-connectivity. It is based on the deterministic EREW algorithm of Chong and Lam [6] and uses the universal exploration
S-T Connectivity on Digraphs with a Known Stationary Distribution
• Mathematics, Computer Science
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
• 2007
This work identifies knowledge of the stationary distribution as the gap between the S-T CONNECTIVITY problems the authors know how to solve in logspace and those that capture all of randomized logspace (RL).
S-T Connectivity on Digraphs with a Known Stationary Distribution
• Mathematics, Computer Science
Computational Complexity Conference
• 2007
This work identifies knowledge of the stationary distribution as the gap between the S-T CONNECTIVITY problems the authors know how to solve in logspace and those that capture all of randomized logspace (RL).
Random walks, universal traversal sequences, and the complexity of maze problems
• Computer Science
20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
• 1979
Results are derived suggesting that the undirected reachability problem is structurally different from, and easier than, the directed version of NSPACE(logn), an affirmative answer to a question of S. Cook.
Pseudorandom walks on regular digraphs and the RL vs. L problem
• Mathematics, Computer Science
STOC '06
• 2006
It is proved that if (2) could be generalized to all regular directed graphs (including ones that are not consistently labelled) then L=RL, and it is shown that such a problem can be solved in deterministic logarithmic space given a log-space pseudorandom walk generator forregular directed graphs.
On traversal sequences, exploration sequences and completeness of kolmogorov random strings
• Computer Science
• 2003
The results imply that under certain intractability assumptions, resource-bounded Kolmogorov complexity of a string as well as circuit size, formula size and branching program size of a Boolean function can not be efficiently approximated.
BP H SPACE(S)⊆DSPACE(S 3/2 )
• Computer Science
FOCS 1999
• 1999
It is shown how to approximate the 2rth power of ad×dmatrix in spaceO(r1/2logd), improving on the bound ofO( rlogd) that comes from the natural recursive algorithm.
Universal Traversal Sequences for Expander Graphs
• Computer Science, Mathematics
Inf. Process. Lett.
• 1993