### 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 2/n-1≤p<1, n>3. The algorithm has O(log^{2}n) 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.6^{k}, where k is a constant.

Original language | English |
---|---|

Pages (from-to) | 29-36 |

Number of pages | 8 |

Journal | Parallel Processing Letters |

Volume | 4 |

Issue number | 1-2 |

Publication status | Published - 1994 Jun 1 |

### All Science Journal Classification (ASJC) codes

- Software
- Theoretical Computer Science
- Hardware and Architecture

## Fingerprint Dive into the research topics of 'Processor efficient connectivity algorithm on random graphs'. Together they form a unique fingerprint.

## Cite this

Yang, S. B., Dhall, S. K., & Lakshmivarahan, S. (1994). Processor efficient connectivity algorithm on random graphs.

*Parallel Processing Letters*,*4*(1-2), 29-36.