Cited By
View all- Bilò DDi Fonso ADi Stefano GLeucci S(2025)On the Approximability of Graph Visibility ProblemsWALCOM: Algorithms and Computation10.1007/978-981-96-2845-2_4(47-61)Online publication date: 21-Feb-2025
Finding large independent sets of hypergraphs in parallel
Pages 163 - 168
Abstract
A basic problem in hypergraphs is that of finding a large independent set-one of guaranteed size-in a given hypergraph. 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, Vol. 15, pp. 99-107, 1991) have shown a certain lower bound αk(H) on the size of a maximum independent set in a given k-uniform hypergraph H, and have also presented an efficien sequential algorithm to find an independent set of size αk (H). They also show that αk (H) is the size of the maximum independent set for various hypergraph families. Here, we develop the first RNC algorithm to find an independent set of size αk(H), and also derandomize it for various special cases. We also present lower bounds on independent set size and corresponding RNC algorithms for non-uniform hypergraphs.
References
[1]
N. Alon, L. Babai and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. of Algorithms, 7,pp. 567-583, 1986.
[2]
N. Alon and M. Naor. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica, 16:434-449, 1996.
[3]
N. Alon and J. H. Spencer. The Probabilistic Method. Wiley-Interscience, 1992.
[4]
P. Beame and M. Luby. Parallel search for maximal independence given minimal dependence. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 212-218, 1990.
[5]
A. Z. Broder, M. Charikar, A.M. Frieze and M. Mitzenmacher. Min-wise independent permutations. In Proc. ACM Symposium on Theory of Computing, 1998.
[6]
Y. Caro and Z. Tuza. Improved lower bounds on k-independence. J. Graph Theory, 15, pp. 99-107, 1991.
[7]
E. Dahlhaus, M. Karpinski, and P. Kelsen. An efficient parallel algorithm for computing a maximal independent setinahypergraph of dimension 3. Information Processing Letters, 42(6):309-314, 1992.
[8]
C. M. Fortuin, J. Ginibre, P. N. Kasteleyn, Correlational Inequalities for Partially Ordered Sets, Communications of Mathematical Physics, 22,pp. 89-103, 1971.
[9]
M. Goldberg and T. Spencer. A new parallel algorithm for the maximal independent set problem. SIAM J. Comput., 18:419-427, 1989.
[10]
M. Goldberg and T. Spencer. An efficient parallel algorithm that finds independent sets of guaranteed size. SIAM J. Disc. Math., 6:443-459, 1993.
[11]
M. Hofri. Analysis of Algorithms. Oxford University Press, 1995.
[12]
P. Indyk. A small approximately min-wise independent family of hash functions. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 454-456, 1999.
[13]
D. R. Karger and D. Koller. (De)randomized construction of small sample spaces in NC. Journal of Computer and System Sciences, 55 (1997), pp. 402-413.
[14]
R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In Handbook of Theoretical Computer Science, Volume A, J.van Leeuwen, Editor, Elsevier, New York, pages 871-941, 1990.
[15]
R. M. Karp, E. Upfal, and A. Wigderson. The complexity of parallel search. Journal of Computer and System Sciences, 36:225-253, 1988.
[16]
R. M. Karp and A. Wigderson. A fast parallel algorithm for the maximal independent set problem. J. Assoc. Comput. Mach., 32:762-773, 1985.
[17]
P. Kelsen. On the parallel complexity of computing a maximal independent setinahypergraph. In Proc. ACM Symposium on Theory of Computing, pages 339-350, 1992.
[18]
M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15 (1986), pp. 1036-1053.
[19]
T. Luczak and E. Szymanska. A Parallel Randomized Algorithm for Finding a Maximal Independent Setin a Linear Hypergraph. J. Algorithms, 25:311-320, 1997.
[20]
R. J. McEliece and K. N. Sivarajan. Performance limits for channelized cellular telephone systems. IEEE Trans. Info. Theory, 40(1):21-34, 1994.
[21]
R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge Univ. Press, 1995.
[22]
J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. SIAM Journal on Computing, 22:838-856, 1993.
[23]
J. H. Spencer. The probabilistic lens: Sperner, Turan and Bregman revisited. In A Tribute to Paul Erdos (A. Baker, B. Bollobas, A. Hajnal, Eds.), Cambridge Univ. Press, pp. 391-396, 1990.
[24]
A. Srinivasan. New approaches to covering and packing problems. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 567-576, 2001.
[25]
E. Szymanska. Derandomization of a Parallel MIS Algorithm in a Linear Hypergraph. In Proc. Fourth International Workshop on Randomization and Approximation Techniques in Computer Science, pages 39-52, 2000.
[26]
P. Turan. On the theory of graphs. Colloq. Math., 3, pp. 19-30, 1954.
Index Terms
- Finding large independent sets of hypergraphs in parallel
Recommendations
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 ...
On Computing Maximal Independent Sets of Hypergraphs in Parallel
Special Issue for SPAA 2014Whether or not the problem of finding maximal independent sets (MIS) in hypergraphs is in (R)NC is one of the fundamental problems in the theory of parallel computing. Essentially, the challenge is to design (randomized) algorithms in which the number ...
On computing maximal independent sets of hypergraphs in parallel
SPAA '14: Proceedings of the 26th ACM symposium on Parallelism in algorithms and architecturesWhether or not the problem of finding maximal independent sets (MIS)in hypergraphs is in R NC is one of the fundamental problems in the theory of parallel computing. Unlike the well-understood case of MIS in graphs, for the hypergraph problem, our ...
Comments
Information & Contributors
Information
Published In
Copyright © 2001 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 03 July 2001
Check for updates
Author Tags
Qualifiers
- Article
Conference
Acceptance Rates
SPAA '01 Paper Acceptance Rate 34 of 93 submissions, 37%;
Overall Acceptance Rate 447 of 1,461 submissions, 31%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 336Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)1
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
Cited By
View all- Bilò DDi Fonso ADi Stefano GLeucci S(2025)On the Approximability of Graph Visibility ProblemsWALCOM: Algorithms and Computation10.1007/978-981-96-2845-2_4(47-61)Online publication date: 21-Feb-2025
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in