In this paper we present a randomized parallel algorithm for finding a maximal independent set in a random graph with n vertices in which the edges are chosen with probability p such that 2 (n-1)≤p<1. The algorithm has O(log2n) expected time using only O(n) processors on the EREW PRAM model.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications