Low‐diameter graph decomposition is in NC

Baruch Awerbuch; Bonnie Berger; Lenore Cowen; David Peleg

doi:10.1002/rsa.3240050305

Low‐diameter graph decomposition is in NC

Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Abstract

Original language	English
Pages (from-to)	441-452
Number of pages	12
Journal	Random Structures and Algorithms
Volume	5
Issue number	3
DOIs	https://doi.org/10.1002/rsa.3240050305
State	Published - Jul 1994
Externally published	Yes

Access to Document

10.1002/rsa.3240050305

Cite this

@article{b60aabe012ac45089d179b8ab5149121,

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

abstract = "We obtain the first NC algorithm for the low‐diameter graph decomposition problem on arbitrary graphs. Our algorithm runs in O(log5(n)) time, and uses O(n2) processors. {\textcopyright} 1994 John Wiley \& Sons, Inc.",

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

year = "1994",

month = jul,

doi = "10.1002/rsa.3240050305",

language = "אנגלית",

volume = "5",

pages = "441--452",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "3",

}

TY - JOUR

T1 - Low‐diameter graph decomposition is in NC

AU - Awerbuch, Baruch

AU - Berger, Bonnie

AU - Cowen, Lenore

AU - Peleg, David

PY - 1994/7

Y1 - 1994/7

N2 - We obtain the first NC algorithm for the low‐diameter graph decomposition problem on arbitrary graphs. Our algorithm runs in O(log5(n)) time, and uses O(n2) processors. © 1994 John Wiley & Sons, Inc.

AB - We obtain the first NC algorithm for the low‐diameter graph decomposition problem on arbitrary graphs. Our algorithm runs in O(log5(n)) time, and uses O(n2) processors. © 1994 John Wiley & Sons, Inc.

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

U2 - 10.1002/rsa.3240050305

DO - 10.1002/rsa.3240050305

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84990639742

SN - 1042-9832

VL - 5

SP - 441

EP - 452

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 3

ER -

Low‐diameter graph decomposition is in NC

Abstract

Access to Document

Other files and links

Fingerprint

Cite this