Thumbnail
Access Restriction
Subscribed

Author Roy, Armoni ♦ Ta-Shma, Amnon ♦ Widgerson, Avi ♦ Zhou, Shiyu
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2000
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Computational complexity ♦ Derandomization ♦ Short pseudorandom walks on graphs ♦ Space bounded computations ♦ Undirected graph connectivity
Abstract We present a deterministic algorithm that computes $\textit{st}-connectivity$ in undirected graphs using $\textit{O}(log$ $4/3\textit{n})$ space. This improves the previous $\textit{O}(log3/2\textit{n})$ bound of Nisan et al. [1992].
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2000-03-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 47
Issue Number 2
Page Count 18
Starting Page 294
Ending Page 311


Open content in new tab

   Open content in new tab
Source: ACM Digital Library