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.
Original language | American English |
---|---|
Pages (from-to) | 1021-1034 |
Number of pages | 14 |
Journal | SIAM Journal on Computing |
Volume | 28 |
Issue number | 3 |
DOIs | |
State | Published - 1999 |
Keywords
- Connected components
- Graph algorithms
- Parallel algorithms
- Random walks