Fast connected components algorithms for the EREW PRAM

David R. Karger*, Noam Nisan, Michal Parnas

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


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.

Original languageAmerican English
Pages (from-to)1021-1034
Number of pages14
JournalSIAM Journal on Computing
Issue number3
StatePublished - 1999


  • Connected components
  • Graph algorithms
  • Parallel algorithms
  • Random walks


Dive into the research topics of 'Fast connected components algorithms for the EREW PRAM'. Together they form a unique fingerprint.

Cite this