Connected components in O(lg/sup 3/2 mod V/ mod ) parallel time for the CREW PRAM

Computing the connected components of an undirected graph G=(V, E) on mod V mod =n vertices and mod E mod =m edges is addressed. An efficient and simple algorithm that runs in O(lg/sup 3/2/ n) time using n+m CREW processors is presented.<
>