Undirected Connectivity in O(log^1.5 n) Space (1997)
by
Noam Nisan
,
Endre Szemeredi
,
Avi Wigderson
| Citations: | 52 - 5 self |
BibTeX
@MISC{Nisan97undirectedconnectivity,
author = {Noam Nisan and Endre Szemeredi and Avi Wigderson},
title = {Undirected Connectivity in O(log^1.5 n) Space},
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a deterministic algorithm for the connectivity problem on undirected graphs that runs in O(log 1:5 n) space. Thus, the recursive doubling technique of Savich which requires O(log^1.5 n) space is not optimal for this problem.
