Abstract
In this paper we present a randomized parallel algorithm for finding the connected components of a random input graph with n vertices in which the edges are chosen with probability p such that [Formula: see text]. The algorithm has O(log2 n) expected time using only O(n) processors on the EREW PRAM model. The probability that the output of our algorithm is correct is at least 1–0.6k, where k is a constant.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
