Low-diameter graph decomposition is in NC

Baruch Awerbuch; Bonnie Berger; Lenore Cowen; David Peleg

doi:10.1007/3-540-55706-7_8

Low-diameter graph decomposition is in NC

Baruch Awerbuch
, Bonnie Berger
, Lenore Cowen
, David Peleg

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

10 Scopus citations

Abstract

We obtain the first deterministic NC algorithm for the lowdiameter graph decomposition problem on arbitrary graphs. We achieve this through derandomizing an algorithm of Linial and Saks. Our algorithm runs in O(log5(n)) time and uses O(n2) processors.

Original language	English
Title of host publication	Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings
Editors	Otto Nurmi, Esko Ukkonen
Publisher	Springer Verlag
Pages	83-93
Number of pages	11
ISBN (Print)	9783540557067
DOIs	https://doi.org/10.1007/3-540-55706-7_8
State	Published - 1992
Externally published	Yes
Event	3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992 - Helsinki, Finland Duration: 8 Jul 1992 → 10 Jul 1992

Publication series

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

Conference

Conference	3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992
Country/Territory	Finland
City	Helsinki
Period	8/07/92 → 10/07/92

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.

Funding

In this paper, we achieve the first polylogarithmic-time deterministic parallel algorithm for (X, d)-decomposition. The algorithm decomposes an arbitrary graph * Supported by Air Force Contract TNDGAFOSR-86-0078, ARO contract DAAL03-86-K-0171, NSF contract CCR8611442, DARPA contract N00014-89-J-1988, and a special grant from IBM. ** Supported by an NSF Postdoctoral Research Fellowship. *~ Supported in part by DARPA contracts N00014-87-K-0825 and N00014-89-J-1988, Air Force Contract OSR-89-02171, Army Contract DAAL-03-86-K-0171 and Navy-ONR Contract N00014-19-J-1698 I Supported in part by an Allon Fellowship, by a Bantrell Fellowship and by a Waiter and Elise Haas Career Development Award.

Funders	Funder number
National Science Foundation	CCR8611442
Army Research Office	DAAL-03-86-K-0171
Defense Advanced Research Projects Agency	N00014-89-J-1988
International Business Machines Corporation	N00014-19-J-1698, N00014-87-K-0825, OSR-89-02171
Air Force Institute of Technology	TNDGAFOSR-86-0078

Access to Document

10.1007/3-540-55706-7_8

Cite this

Awerbuch, B., Berger, B., Cowen, L., & Peleg, D. (1992). Low-diameter graph decomposition is in NC. In O. Nurmi, & E. Ukkonen (Eds.), Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings (pp. 83-93). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 621 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-55706-7_8

Awerbuch, Baruch ; Berger, Bonnie ; Cowen, Lenore et al. / Low-diameter graph decomposition is in NC. Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings. editor / Otto Nurmi ; Esko Ukkonen. Springer Verlag, 1992. pp. 83-93 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5a58c8b3a25547cdaf4c2497428224c9,

title = "Low-diameter graph decomposition is in NC",

abstract = "We obtain the first deterministic NC algorithm for the lowdiameter graph decomposition problem on arbitrary graphs. We achieve this through derandomizing an algorithm of Linial and Saks. Our algorithm runs in O(log5(n)) time and uses O(n2) processors.",

author = "Baruch Awerbuch and Bonnie Berger and Lenore Cowen and David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1992.; 3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992 ; Conference date: 08-07-1992 Through 10-07-1992",

year = "1992",

doi = "10.1007/3-540-55706-7\_8",

language = "אנגלית",

isbn = "9783540557067",

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

publisher = "Springer Verlag",

pages = "83--93",

editor = "Otto Nurmi and Esko Ukkonen",

booktitle = "Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings",

address = "גרמניה",

}

Awerbuch, B, Berger, B, Cowen, L & Peleg, D 1992, Low-diameter graph decomposition is in NC. in O Nurmi & E Ukkonen (eds), Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 621 LNCS, Springer Verlag, pp. 83-93, 3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992, Helsinki, Finland, 8/07/92. https://doi.org/10.1007/3-540-55706-7_8

Low-diameter graph decomposition is in NC. / Awerbuch, Baruch; Berger, Bonnie; Cowen, Lenore et al.
Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings. ed. / Otto Nurmi; Esko Ukkonen. Springer Verlag, 1992. p. 83-93 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 621 LNCS).

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

TY - GEN

T1 - Low-diameter graph decomposition is in NC

AU - Awerbuch, Baruch

AU - Berger, Bonnie

AU - Cowen, Lenore

AU - Peleg, David

PY - 1992

Y1 - 1992

N2 - We obtain the first deterministic NC algorithm for the lowdiameter graph decomposition problem on arbitrary graphs. We achieve this through derandomizing an algorithm of Linial and Saks. Our algorithm runs in O(log5(n)) time and uses O(n2) processors.

AB - We obtain the first deterministic NC algorithm for the lowdiameter graph decomposition problem on arbitrary graphs. We achieve this through derandomizing an algorithm of Linial and Saks. Our algorithm runs in O(log5(n)) time and uses O(n2) processors.

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

U2 - 10.1007/3-540-55706-7_8

DO - 10.1007/3-540-55706-7_8

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

AN - SCOPUS:84976699051

SN - 9783540557067

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

SP - 83

EP - 93

BT - Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings

A2 - Nurmi, Otto

A2 - Ukkonen, Esko

PB - Springer Verlag

T2 - 3rd Scandinavian Workshop on Algorithm Theory, SWAT 1992

Y2 - 8 July 1992 through 10 July 1992

ER -

Awerbuch B, Berger B, Cowen L, Peleg D. Low-diameter graph decomposition is in NC. In Nurmi O, Ukkonen E, editors, Algorithm Theory – SWAT 1992 - 3rd Scandinavian Workshop on Algorithm Theory, Proceedings. Springer Verlag. 1992. p. 83-93. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-55706-7_8

Low-diameter graph decomposition is in NC

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this