Technical Report Number
Computing the connected components of an undirected graph G = (V,E) on |V| = n vertices and |E| = m edges is a fundamental computational problem. The best known parallel algorithm for the CREW PRAM model runs on O(lg2n) time using n2/lg2n processors [CLC82,HCS79]. For the CRCW PRAM model in which concurrent writing is permitted, the best known algorithm runs in O(lg n) time using almost (n+m)/lg n processors [SV82,CV86,AS87]. Unfortunately, simulating this algorithm on the weaker CREW model increases its running time to O(lg2n) [CDR86, KR90,Vis83]. We present here an efficient and simple algorithm that runs in O(lg 3/2n) time using n+m CREW processors.
Dartmouth Digital Commons Citation
Johnson, Donald B. and Metaxas, Panagiotis, "Connected Components in O(lg3/2|V|) Parallel Time for the CREW PRAM" (1991). Computer Science Technical Report PCS-TR91-160. https://digitalcommons.dartmouth.edu/cs_tr/60