Undirected connectivity in O(log/sup 1.5/n) space

Noam Nisan, E. Szemerédi, Avi Wigderson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

51 Citations (Scopus)

Abstract

The authors present a deterministic algorithm for the connectivity problem on undirected graphs that runs in O(log/sup 1.5/n) space. Thus, the recursive doubling technique of Savich (1970) which requires Theta (log 2 n) space is not optimal for this problem.

Original languageEnglish
Title of host publicationProceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
PublisherIEEE Computer Society
Pages24-29
Number of pages6
ISBN (Electronic)0818629002
DOIs
Publication statusPublished - Jan 1 1992
Event33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States
Duration: Oct 24 1992Oct 27 1992

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume1992-October
ISSN (Print)0272-5428

Conference

Conference33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
CountryUnited States
CityPittsburgh
Period10/24/9210/27/92

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Nisan, N., Szemerédi, E., & Wigderson, A. (1992). Undirected connectivity in O(log/sup 1.5/n) space. In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 (pp. 24-29). [267822] (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October). IEEE Computer Society. https://doi.org/10.1109/SFCS.1992.267822