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

Noam Nisan, Endre Szemeredi, Avi Wigderson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

55 Scopus citations

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 (log2n) space is not optimal for this problem.

Original languageAmerican English
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
StatePublished - 1992
Event33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States
Duration: 24 Oct 199227 Oct 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
Country/TerritoryUnited States
CityPittsburgh
Period24/10/9227/10/92

Bibliographical note

Publisher Copyright:
© 1992 IEEE.

Fingerprint

Dive into the research topics of 'Undirected connectivity in O(log/sup 1.5/n) space'. Together they form a unique fingerprint.

Cite this