An O(Iog(n)4/3) Space Algorithm for (s, t) Connectivity in Undirected Graphs

Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou

Research output: Contribution to journalArticlepeer-review


We present a deterministic algorithm that computes st-connectivity in undirected graphs using O(Iog4/3 n) space. This improves the previous O(log3/2 n) bound of Nisan et al. [1992].

Original languageEnglish
Pages (from-to)294-311
Number of pages18
JournalJournal of the ACM
Issue number2
StatePublished - 2000
Externally publishedYes


  • Computational complexity
  • Derandomization
  • Short pseudorandom walks on graphs
  • Space bounded computations
  • Undirected graph connectivity

Cite this