Optimal randomized logarithmic time connectivity algorithm for the EREW PRAM

Shay Halperin*, Uri Zwick

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

27 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 o(n-c) for any c>0.

Original languageEnglish
Pages (from-to)395-416
Number of pages22
JournalJournal of Computer and System Sciences
Volume53
Issue number3
DOIs
StatePublished - 1996

Funding

FundersFunder number
Basic Research Foundation
Israel Academy of Sciences and Humanities

    Fingerprint

    Dive into the research topics of 'Optimal randomized logarithmic time connectivity algorithm for the EREW PRAM'. Together they form a unique fingerprint.

    Cite this