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

50 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

Undirected connectivity in O(log/sup 1.5/n) space. / Nisan, Noam; Szemerédi, E.; Wigderson, Avi.

Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. p. 24-29 267822 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October).

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

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., 267822, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 1992-October, IEEE Computer Society, pp. 24-29, 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992, Pittsburgh, United States, 10/24/92. https://doi.org/10.1109/SFCS.1992.267822
Nisan N, Szemerédi E, Wigderson A. Undirected connectivity in O(log/sup 1.5/n) space. In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society. 1992. p. 24-29. 267822. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS). https://doi.org/10.1109/SFCS.1992.267822
Nisan, Noam ; Szemerédi, E. ; Wigderson, Avi. / Undirected connectivity in O(log/sup 1.5/n) space. Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. pp. 24-29 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
@inproceedings{a117307c06ca4525a9108a2cf83de3a4,
title = "Undirected connectivity in O(log/sup 1.5/n) space",
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.",
author = "Noam Nisan and E. Szemer{\'e}di and Avi Wigderson",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/SFCS.1992.267822",
language = "English",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "24--29",
booktitle = "Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992",

}

TY - GEN

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

AU - Nisan, Noam

AU - Szemerédi, E.

AU - Wigderson, Avi

PY - 1992/1/1

Y1 - 1992/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85027620866&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027620866&partnerID=8YFLogxK

U2 - 10.1109/SFCS.1992.267822

DO - 10.1109/SFCS.1992.267822

M3 - Conference contribution

AN - SCOPUS:85027620866

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 24

EP - 29

BT - Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992

PB - IEEE Computer Society

ER -