A simple proof that finding a maximal independent set in a graph is in NC

Authors:
Aaron Windsor
Affiliations:
Computer Science Department, University of Georgia, Athens, GA 30602, USA
Venue:
Information Processing Letters
Year:
2004

Citing 6
Cited 0

A fast parallel algorithm for the maximal independent set problem

Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for the maximal independent set problem

Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
A new parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
An efficient parallel algorithm that finds independent sets of guaranteed size

SIAM Journal on Discrete Mathematics
A small approximately min-wise independent family of hash functions

Journal of Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

An independent set in a graph G is a set I@?V(G) such that the induced subgraph on I has no edges. A maximal independent set (MIS) is an independent set not properly contained in any other independent set. We present a simple proof that an algorithm of Luby [SIAM J. Comput. 15 (1986) 1036] is an RNC algorithm for finding an MIS in a graph. Our proof can be easily derandomized, giving a corresponding NC algorithm.