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 …

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 …

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 …

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 …

FINDING A MAXIMUM INDEPENDENT SET* edges. Two vertices v, w are adjacent if (v, w)eE.
A set S of vertices is the graph G(S)= (S, Page 1 SIAM J. COMPUT. Vol. 6, No. September 1977 …

Abstract The Maximal Independent Set (MIS) problem is one of the basics in the study of
locality in distributed graph algorithms. This paper presents a very simple randomized …

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 …

An efficient randomized heuristic for a maximum independent set is presented. The
procedure is tested on randomly generated graphs having from 400 to 3,500 vertices and …