Finding large independent sets in graphs and hypergraphs

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 3, 2004, Pages 488-500

  Shachnai, Hadas ^a   Srinivasan, Aravind ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Institute of Advanced Computer Science   (United States)

Author keywords

Independent sets; Parallel algorithms; Randomized algorithms

Indexed keywords

HYPERGRAPHS; INDEPENDENT SETS; PARALLEL COMBINATORIAL OPTIMIZATION; RANDOMIZED ALGORITHMS;

COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL ALGORITHMS; SET THEORY;

GRAPH THEORY;

EID: 23844475813     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480102419731     Document Type: Article

References (28)

1. N. ALON, L. BABAI, AND A. ITAI, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7 (1986), pp. 567-583.
2. N. ALON AND J. H. SPENCER, The Probabilistic Method, 2nd ed., Wiley-Interscience, New York, 2000.
3. P. BEAME AND M. LUBY, Parallel search for maximal independence given minimal dependence, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1990, pp. 212-218.
4. A. Z. BRODER, M. CHARIKAR, A. M. FRIEZE, AND M. MITZENMACHER, Min-wise independent permutations, J. Comput. System Sci., 60 (2000), pp. 630-659.
5. Y. CARO AND Z. TUZA, Improved lower bounds on k-independence, J. Graph Theory, 15 (1991), pp. 99-107.
6. E. DAHLHAUS, M. KARPINSKI, AND P. KELSEN, An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3, Inform. Process. Lett., 42 (1992), pp. 309-314.
7. C. M. FORTUIN, J. GINIBRE, AND P. N. KASTELEYN, Correlational inequalities for partially ordered sets, Comm. Math. Phys., 22 (1971), pp. 89-103.
8. M. GOLDBERG AND T. SPENCER, A new parallel algorithm for the maximal independent set problem, SIAM J. Comput., 18 (1989), pp. 419-427.
9. M. GOLDBERG AND T. SPENCER, An efficient parallel algorithm that finds independent sets of guaranteed size, SIAM J. Discrete Math., 6 (1993), pp. 443-459.
10. M. HOFRI, Analysis of Algorithms, Oxford University Press, Oxford, UK, 1995.
11. P. INDYK, A small approximately min-wise independent family of hash functions, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1999, pp. 454-456.
12. D. R. KARGER AND D. KOLLER, (De)randomized construction of small sample spaces in NC, J. Comput. System Sci., 55 (1997), pp. 402-413.
13. R. M. KARP AND V. RAMACHANDRAN, Parallel algorithms for shared memory machines, in Handbook of Theoretical Computer Science, Volume A, J. van Leeuwen, ed., Elsevier, New York, 1990, pp. 871-941.
14. R. M. KARP, E. UPFAL, AND A. WIGDERSON, The complexity of parallel search, J. Comput. System Sci., 36 (1988), pp. 225-253.
15. R. M. KARP AND A. WIGDERSON, A fast parallel algorithm for the maximal independent set problem, JACM, 32 (1985), pp. 762-773.
16. P. KELSEN, On the parallel complexity of computing a maximal independent set in a hypergraph, in Proceedings of the ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 339-350.
17. M. LUBY, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1053.
18. T. LUCZAK AND E. SZYMAŃSKA, A parallel randomized algorithm for finding a maximal independent set in a linear hypergraph, J. Algorithms, 25 (1997), pp. 311-320.
19. R. J. MCELIECE AND K. N. SlVARAJAN, Performance limits for channelized cellular telephone systems, IEEE Trans. Inform. Theory, 40 (1994), pp. 21-34.
20. S. MAHAJAN, E. A. RAMOS, AND K. V. SUBRAHMANYAM, Solving some discrepancy problems in NC, Algorithmica, 29 (2001), pp. 371-395.
21. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
22. N. NISAN, Pseudorandom generators for space-bounded computation, Combinatorica, 12 (1992), pp. 449-461.
23. N. NISAN, RL ⊆ SC, in Proceedings of the ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 619-623.
24. R. SEDGEWICK AND P. FLAJOLET, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA, 1996.
25. D. SIVAKUMAR, Algorithmic derandomization via complexity theory, in Proceedings of the ACM Symposium on Theory of Computing, ACM, New York, 2002, pp. 619-626.
26. J. H. SPENCER, The probabilistic lens: Sperner, Turán and Brégman revisited, in A Tribute to Paul Erdos, A. Baker, B. Bollobás, and A. Hajnal, eds., Cambridge University Press, Cambridge, UK, 1990, pp. 391-396.
27. E. SZYMAŃSKA, Derandomization of a parallel MIS algorithm in a linear hypergraph, in Proceedings of the International Colloquium on Automata, Languages and Programming, Satellite Workshops, Carleton Scientific, Waterloo, Canada, 2000, pp. 39-52.
28. P. TURÁN, On the theory of graphs, Colloq. Math., 3 (1954), pp. 19-30.