TY - JOUR
T1 - Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests
AU - Halperin, Shay
AU - Zwick, Uri
N1 - Funding Information:
1Work supported in part by The Basic Research Foundation administrated by The Israel Academy of Sciences and Humanities.
PY - 2001/4
Y1 - 2001/4
N2 - We present the first randomized O(log n) time and O(m + n) work EREW PRAM algorithm for finding a spanning forest of an undirected graph G = (V, E) with n vertices and m edges. Our algorithm is optimal with respect to time, work, and space. As a consequence we get optimal randomized EREW PRAM algorithms for other basic connectivity problems such as finding a bipartite partition, finding bridges and biconnected components, finding Euler tours in Eulerian graphs, finding an ear decomposition, finding an open ear decomposition, finding a strong orientation, and finding an st-numbering.
AB - We present the first randomized O(log n) time and O(m + n) work EREW PRAM algorithm for finding a spanning forest of an undirected graph G = (V, E) with n vertices and m edges. Our algorithm is optimal with respect to time, work, and space. As a consequence we get optimal randomized EREW PRAM algorithms for other basic connectivity problems such as finding a bipartite partition, finding bridges and biconnected components, finding Euler tours in Eulerian graphs, finding an ear decomposition, finding an open ear decomposition, finding a strong orientation, and finding an st-numbering.
UR - http://www.scopus.com/inward/record.url?scp=0012637354&partnerID=8YFLogxK
U2 - 10.1006/jagm.2000.1146
DO - 10.1006/jagm.2000.1146
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0012637354
SN - 0196-6774
VL - 39
SP - 1
EP - 46
JO - Journal of Algorithms
JF - Journal of Algorithms
IS - 1
ER -