Fast connected components algorithms for the EREW PRAM

David R. Karger; Noam Nisan; Michal Parnas

doi:10.1137/s009753979325247x

Fast connected components algorithms for the EREW PRAM

David R. Karger^*, Noam Nisan, Michal Parnas

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

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

16 Scopus citations

Abstract

We present fast and efficient parallel algorithms for finding the connected components of an undirected graph. These algorithms run on the exclusive-read, exclusive-write (EREW) PRAM. On a graph with n vertices and m edges, our randomized algorithm runs in O(log n) time using (m + n^1+∈)/log n EREW processors (for any fixed ∈ > 0). A variant uses (m + n)/log n processors and runs in O(log n log log n) time. A deterministic version of the algorithm runs in O(log^1.5 n) time using m + n EREW processors.

Original language	English
Pages (from-to)	1021-1034
Number of pages	14
Journal	SIAM Journal on Computing
Volume	28
Issue number	3
DOIs	https://doi.org/10.1137/s009753979325247x
State	Published - 1999

Keywords

Connected components
Graph algorithms
Parallel algorithms
Random walks

Access to Document

10.1137/s009753979325247x

Cite this

@article{f462f68dfce7421085363aaa79505789,

title = "Fast connected components algorithms for the EREW PRAM",

abstract = "We present fast and efficient parallel algorithms for finding the connected components of an undirected graph. These algorithms run on the exclusive-read, exclusive-write (EREW) PRAM. On a graph with n vertices and m edges, our randomized algorithm runs in O(log n) time using (m + n1+∈)/log n EREW processors (for any fixed ∈ > 0). A variant uses (m + n)/log n processors and runs in O(log n log log n) time. A deterministic version of the algorithm runs in O(log1.5 n) time using m + n EREW processors.",

keywords = "Connected components, Graph algorithms, Parallel algorithms, Random walks",

author = "Karger, {David R.} and Noam Nisan and Michal Parnas",

year = "1999",

doi = "10.1137/s009753979325247x",

language = "אנגלית",

volume = "28",

pages = "1021--1034",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "3",

}

TY - JOUR

T1 - Fast connected components algorithms for the EREW PRAM

AU - Karger, David R.

AU - Nisan, Noam

AU - Parnas, Michal

PY - 1999

Y1 - 1999

N2 - We present fast and efficient parallel algorithms for finding the connected components of an undirected graph. These algorithms run on the exclusive-read, exclusive-write (EREW) PRAM. On a graph with n vertices and m edges, our randomized algorithm runs in O(log n) time using (m + n1+∈)/log n EREW processors (for any fixed ∈ > 0). A variant uses (m + n)/log n processors and runs in O(log n log log n) time. A deterministic version of the algorithm runs in O(log1.5 n) time using m + n EREW processors.

AB - We present fast and efficient parallel algorithms for finding the connected components of an undirected graph. These algorithms run on the exclusive-read, exclusive-write (EREW) PRAM. On a graph with n vertices and m edges, our randomized algorithm runs in O(log n) time using (m + n1+∈)/log n EREW processors (for any fixed ∈ > 0). A variant uses (m + n)/log n processors and runs in O(log n log log n) time. A deterministic version of the algorithm runs in O(log1.5 n) time using m + n EREW processors.

KW - Connected components

KW - Graph algorithms

KW - Parallel algorithms

KW - Random walks

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

U2 - 10.1137/s009753979325247x

DO - 10.1137/s009753979325247x

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

AN - SCOPUS:0032284176

SN - 0097-5397

VL - 28

SP - 1021

EP - 1034

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 3

ER -

Fast connected components algorithms for the EREW PRAM

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this