A simple parallel randomized algorithm to find a maximal independent set in a graph G=(V,
E) on n vertices is presented. Its expected running time on a concurrent-read concurrent …

A parallel algorithm is presented that accepts as input a graph G and produces a maximal
independent set of vertices in G. On a P-RAM without the concurrent write or concurrent read …

A new parallel algorithm for the maximal independent set problem is constructed. It runs in
O(\log^4n) time when implemented on a linear number of EREW-processors. This is the first …

Simple parallel algorithms for the maximal independent set (MIS) problem are presented.
The first algorithm is a Monte Carlo algorithm with a very local property. The local property of …

Suppose that an independence system (E,I) is characterized by a subroutine which indicates
in unit time whether or not a given subset of E is independent. It is shown that there is no …

We develop some general techniques for converting randomized parallel algorithms into
deterministic parallel algorithms without a blowup in the number of processors. One of the …

We provide a tight analysis that settles the round complexity of the well-studied parallel
randomized greedy MIS algorithm, thus answering the main open question of Blelloch …

An algorithm is presented which finds (the size of) a maximum independent set of an n
vertex graph in time O (2 0.276n) improving on a previous bound of O (2 n 3). The …

An O(2^0.304n) Algorithm for Solving Maximum Independent Set Problem Page 1
IEEE TRANSACTIONS ON COMPUTERS, VOL. C-35, NO. 9, SEPTEMBER 1986 channel …

We show that the maximum independent set problem on an n-vertex graph can be solved in
1.1996 nn O (1) time and polynomial space, which even is faster than Robson's 1.2109 nn O …