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

Shay Halperin, Uri Zwick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994
PublisherAssociation for Computing Machinery, Inc
Pages1-10
Number of pages10
ISBN (Electronic)0897916719, 9780897916714
DOIs
StatePublished - 1 Aug 1994
Event6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994 - Cape May, United States
Duration: 27 Jun 199429 Jun 1994

Publication series

NameProceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994

Conference

Conference6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994
Country/TerritoryUnited States
CityCape May
Period27/06/9429/06/94

Fingerprint

Dive into the research topics of 'An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)'. Together they form a unique fingerprint.

Cite this