Fast connected components algorithms for the EREW PRAM

David R. Karger*, Noam Nisan, Michal Parnas

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

27 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 yertices 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
Title of host publication4th Annual ACM Symposium on Parallel Algorithms and Architectures
PublisherPubl by ACM
Pages373-381
Number of pages9
ISBN (Print)089791483X, 9780897914833
DOIs
StatePublished - 1992
Externally publishedYes
Event4th Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA '92 - San Diego, CA, USA
Duration: 29 Jun 19921 Jul 1992

Publication series

Name4th Annual ACM Symposium on Parallel Algorithms and Architectures

Conference

Conference4th Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA '92
CitySan Diego, CA, USA
Period29/06/921/07/92

Fingerprint

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

Cite this