[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)

San Juan, Puerto Rico

Oct. 1, 1991 to Oct. 4, 1991

ISBN: 0-8186-2445-0

pp: 688-697

D.B. Johnson , Dartmouth Coll., Hanover, NH, USA

P. Metaxas , Dartmouth Coll., Hanover, NH, USA

ABSTRACT

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.

INDEX TERMS

CREW processors, parallel time, CREW PRAM, connected components, undirected graph, vertices, edges

CITATION

P. Metaxas and D. Johnson, "Connected components in O(lg/sup 3/2 mod V/ mod ) parallel time for the CREW PRAM,"

*[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS)*, San Juan, Puerto Rico, 1991, pp. 688-697.

doi:10.1109/SFCS.1991.185437

CITATIONS