Sciweavers

STOC
2005
ACM
163views Algorithms» more  STOC 2005»
14 years 5 months ago
Undirected ST-connectivity in log-space
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...
Omer Reingold