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 2/n-1≤p<1, n>3. The algorithm has O(log2n) expected time using only O(n) processors on the EREW PRAM model. The probability that time output of our algorithm is correct is at least 1 - 0.6k, where k is a constant.
|Number of pages||8|
|Journal||Parallel Processing Letters|
|Publication status||Published - 1994 Jun|
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Hardware and Architecture