The complexity of graph connectivity

Avi Wigderson

doi:10.1007/3-540-55808-x_10

The complexity of graph connectivity

Avi Wigderson^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

53 Scopus citations

Abstract

In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging open problems.

Original language	English
Title of host publication	Mathematical Foundations of Computer Science 1992 - 17 International Symposium, Proceedings
Editors	Ivan M. Havel, Vaclav Koubek
Publisher	Springer Verlag
Pages	112-132
Number of pages	21
ISBN (Print)	9783540558088
DOIs	https://doi.org/10.1007/3-540-55808-x_10
State	Published - 1992
Event	17th Symposium on Mathematical Foundations of Computer Science, MFCS 1992 - Prague, Czech Republic Duration: 24 Aug 1992 → 28 Aug 1992

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	629 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	17th Symposium on Mathematical Foundations of Computer Science, MFCS 1992
Country/Territory	Czech Republic
City	Prague
Period	24/08/92 → 28/08/92

Bibliographical note

Publisher Copyright:
© 1992, Springer Verlag. All rights reserved.

Access to Document

10.1007/3-540-55808-x_10

Cite this

Wigderson, A. (1992). The complexity of graph connectivity. In I. M. Havel, & V. Koubek (Eds.), Mathematical Foundations of Computer Science 1992 - 17 International Symposium, Proceedings (pp. 112-132). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 629 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-55808-x_10

@inproceedings{f080d3885dca4798bc58ba5b14c86b1d,

title = "The complexity of graph connectivity",

abstract = "In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging open problems.",

author = "Avi Wigderson",

note = "Publisher Copyright: {\textcopyright} 1992, Springer Verlag. All rights reserved.; 17th Symposium on Mathematical Foundations of Computer Science, MFCS 1992 ; Conference date: 24-08-1992 Through 28-08-1992",

year = "1992",

doi = "10.1007/3-540-55808-x\_10",

language = "אנגלית",

isbn = "9783540558088",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "112--132",

editor = "Havel, \{Ivan M.\} and Vaclav Koubek",

booktitle = "Mathematical Foundations of Computer Science 1992 - 17 International Symposium, Proceedings",

address = "גרמניה",

}

Wigderson, A 1992, The complexity of graph connectivity. in IM Havel & V Koubek (eds), Mathematical Foundations of Computer Science 1992 - 17 International Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 629 LNCS, Springer Verlag, pp. 112-132, 17th Symposium on Mathematical Foundations of Computer Science, MFCS 1992, Prague, Czech Republic, 24/08/92. https://doi.org/10.1007/3-540-55808-x_10

The complexity of graph connectivity. / Wigderson, Avi.
Mathematical Foundations of Computer Science 1992 - 17 International Symposium, Proceedings. ed. / Ivan M. Havel; Vaclav Koubek. Springer Verlag, 1992. p. 112-132 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 629 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The complexity of graph connectivity

AU - Wigderson, Avi

PY - 1992

Y1 - 1992

N2 - In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging open problems.

AB - In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging open problems.

UR - https://www.scopus.com/pages/publications/0038046962

U2 - 10.1007/3-540-55808-x_10

DO - 10.1007/3-540-55808-x_10

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

AN - SCOPUS:0038046962

SN - 9783540558088

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 112

EP - 132

BT - Mathematical Foundations of Computer Science 1992 - 17 International Symposium, Proceedings

A2 - Havel, Ivan M.

A2 - Koubek, Vaclav

PB - Springer Verlag

T2 - 17th Symposium on Mathematical Foundations of Computer Science, MFCS 1992

Y2 - 24 August 1992 through 28 August 1992

ER -

Wigderson A. The complexity of graph connectivity. In Havel IM, Koubek V, editors, Mathematical Foundations of Computer Science 1992 - 17 International Symposium, Proceedings. Springer Verlag. 1992. p. 112-132. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-55808-x_10

The complexity of graph connectivity

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this