TY - JOUR
T1 - Optimal randomized logarithmic time connectivity algorithm for the EREW PRAM
AU - Halperin, Shay
AU - Zwick, Uri
N1 - Funding Information:
* E-mail addresses: [hshay, zwick] math.tau.ac.il. Work supported in part by The Basic Research Foundation administrated by The Israel Academy of Sciences and Humanities.
PY - 1996
Y1 - 1996
N2 - Improving a long chain of works, we obtain a randomized EREW PRAM algorithm for finding the connected components of a graph G = (V, E) with n vertices and m edges in O(log n) time using an optimal number of O((m+n)/log n) processors. The result returned by the algorithm is always correct. The probability that the algorithm will not complete in O(log n) time is o(n-c) for any c>0.
AB - Improving a long chain of works, we obtain a randomized EREW PRAM algorithm for finding the connected components of a graph G = (V, E) with n vertices and m edges in O(log n) time using an optimal number of O((m+n)/log n) processors. The result returned by the algorithm is always correct. The probability that the algorithm will not complete in O(log n) time is o(n-c) for any c>0.
UR - http://www.scopus.com/inward/record.url?scp=0030393752&partnerID=8YFLogxK
U2 - 10.1006/jcss.1996.0078
DO - 10.1006/jcss.1996.0078
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0030393752
SN - 0022-0000
VL - 53
SP - 395
EP - 416
JO - Journal of Computer and System Sciences
JF - Journal of Computer and System Sciences
IS - 3
ER -