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

Noam Nisan; Endre Szemeredi; Avi Wigderson

doi:10.1109/SFCS.1992.267822

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

Noam Nisan, Endre Szemeredi, Avi Wigderson

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 (log²n) space is not optimal for this problem.

Original language	English
Title of host publication	Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
Publisher	IEEE Computer Society
Pages	24-29
Number of pages	6
ISBN (Electronic)	0818629002
DOIs	https://doi.org/10.1109/SFCS.1992.267822
State	Published - 1992
Event	33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States Duration: 24 Oct 1992 → 27 Oct 1992

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume	1992-October
ISSN (Print)	0272-5428

Conference

Conference	33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
Country/Territory	United States
City	Pittsburgh
Period	24/10/92 → 27/10/92

Bibliographical note

Publisher Copyright:
© 1992 IEEE.

Access to Document

10.1109/SFCS.1992.267822

Cite this

Nisan, N., Szemeredi, 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). Article 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

@inproceedings{29eb9b7ff5d64e1b8baed09fcfa4f9eb,

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

author = "Noam Nisan and Endre Szemeredi and Avi Wigderson",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 ; Conference date: 24-10-1992 Through 27-10-1992",

year = "1992",

doi = "10.1109/SFCS.1992.267822",

language = "אנגלית",

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",

address = "ארצות הברית",

}

Nisan, N, Szemeredi, 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, 24/10/92. https://doi.org/10.1109/SFCS.1992.267822

Undirected connectivity in O(log/sup 1.5/n) space. / Nisan, Noam; Szemeredi, Endre; 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 proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Nisan, Noam

AU - Szemeredi, Endre

AU - Wigderson, Avi

PY - 1992

Y1 - 1992

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

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

U2 - 10.1109/SFCS.1992.267822

DO - 10.1109/SFCS.1992.267822

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

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

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

Y2 - 24 October 1992 through 27 October 1992

ER -

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

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this