A new parallel algorithm for the maximal independent set problem

A new parallel algorithm for the maximal independent set problem (MIS) is constructed. It runs in O(log4 n) time when implemented on a linear number of EREW-processors. This is the first deterministic algorithm for MIS whose running time is polylogarithmic and whose processor-time product is optimal up to a polylogarithmic factor.

[1]  Alok Aggarwal,et al.  A random NC algorithm for depth first search , 1987, Comb..

[2]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[3]  Amos Israeli,et al.  An Improved Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[4]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[5]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[6]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[7]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[8]  Alon Itai,et al.  A Fast and Simple Randomized Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[9]  Andrew V. Goldberg,et al.  Parallel symmetry-breaking in sparse graphs , 1987, STOC.

[10]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[11]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[12]  Victor Y. Pan,et al.  Improved processor bounds for algebraic and combinatorial problems in RNC , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[13]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1984, STOC '84.

[14]  Richard Cole,et al.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.

[15]  Zvi Galil,et al.  Optimal parallel algorithms for string matching , 1984, STOC '84.

[16]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).