TY - GEN

T1 - An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)

AU - Halperin, Shay

AU - Zwick, Uri

N1 - Publisher Copyright:
© 1994 ACM.

PY - 1994/8/1

Y1 - 1994/8/1

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 at most n-c for any desired c > 0. The best deterministic EREW PRAM connectivity algorithm, obtained by Chong and Lam, runs in O(log n log log n) time using m + n processors.

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 at most n-c for any desired c > 0. The best deterministic EREW PRAM connectivity algorithm, obtained by Chong and Lam, runs in O(log n log log n) time using m + n processors.

UR - http://www.scopus.com/inward/record.url?scp=5344269247&partnerID=8YFLogxK

U2 - 10.1145/181014.181017

DO - 10.1145/181014.181017

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:5344269247

T3 - Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994

SP - 1

EP - 10

BT - Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994

PB - Association for Computing Machinery, Inc

T2 - 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994

Y2 - 27 June 1994 through 29 June 1994

ER -