Finding Large Independent Sets in Graphs and Hypergraphs

A basic problem in graphs and hypergraphs is that of finding a large independent set---one of guaranteed size. Understanding the parallel complexity of this and related independent set problems on hypergraphs is a fundamental open issue in parallel computation. Caro and Tuza [J. Graph Theory, 15 (1991), pp. 99--107] have shown a certain lower bound $\alpha_k(H)$ on the size of a maximum independent set in a given k-uniform hypergraph H and have also presented an efficient sequential algorithm to find an independent set of size $\alpha_k(H)$. They also show that $\alpha_k(H)$ is the size of the maximum independent set for various hypergraph families. Here, we show that an RNC algorithm due to Beame and Luby [in Proceedings of the ACM--SIAM Symposium on Discrete Algorithms, 1990, pp. 212--218] finds an independent set of expected size $\alpha_k(H)$ and also derandomizes it for certain special cases. (An intriguing conjecture of Beame and Luby implies that understanding this algorithm better may yield an RNC...

[1]  P. Turán.  On the theory of graphs , 1954 .

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

[3]  David R. Karger,et al.  (De)randomized Construction of Small Sample Spaces in NC , 1997, J. Comput. Syst. Sci..

[4]  Paul Beame,et al.  Parallel search for maximal independence given minimal dependence , 1990, SODA '90.

[5]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[6]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[7]  Noam Nisan,et al.  RL⊆SC , 1992, STOC '92.

[8]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1985, JACM.

[9]  Philippe Flajolet,et al.  An introduction to the analysis of algorithms , 1995 .

[10]  Zsolt Tuza,et al.  Improved lower bounds on k-independence , 1991, J. Graph Theory.

[11]  Pierre Kelsen,et al.  On the parallel complexity of computing a maximal independent set in a hypergraph , 1992, STOC '92.

[12]  Tomasz Luczak,et al.  A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph , 1997, J. Algorithms.

[13]  Alan M. Frieze,et al.  Min-Wise Independent Permutations , 2000, J. Comput. Syst. Sci..

[14]  Michael Luby.  A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..

[15]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[16]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[17]  D. Sivakumar.  Algorithmic derandomization via complexity theory , 2002, STOC '02.

[18]  Philippe Flajolet,et al.  Analysis of algorithms , 2000, Random Struct. Algorithms.

[19]  Kumar N. Sivarajan,et al.  Performance limits for channelized cellular telephone systems , 1994, IEEE Trans. Inf. Theory.

[20]  Marek Karpinski,et al.  An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3 , 1991, Inf. Process. Lett..

[21]  Mark K. Goldberg,et al.  A New Parallel Algorithm for the Maximal Independent Set Problem , 1989, SIAM J. Comput..

[22]  Edyta Szymanska.  Derandomization of a Parallel MIS Algorithm in a Linear Hypergraph , 2000, ICALP Satellite Workshops.

[23]  Mark K. Goldberg,et al.  An efficient parallel algorithm that finds independent sets of guaranteed size , 1993, SODA '90.

[24]  Piotr Indyk,et al.  A small approximately min-wise independent family of hash functions , 1999, SODA '99.

[25]  Edgar A. Ramos,et al.  Solving Some Discrepancy Problems in NC , 2001, Algorithmica.

[26]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computations , 1990, STOC '90.

[27]  Eli Upfal,et al.  The Complexity of Parallel Search , 1988, J. Comput. Syst. Sci..