546 AN ASYNCHRONOUS PARALLEL ALGORITHM FOR UNDIRECTED GRAPH
CONNECTIVITY R. Cole, O. Zajicek, February 1991
An algorithm for computing the components of an undirected graph in the (asynchronous) APRAM model is given; the algorithm uses O(n + e) processes and O(log n) rounds.