A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph

Journal of Algorithms

Volumn 25, Issue 2, 1997, Pages 311-320

  Łuczak, Tomasz ^a   Szymańska, Edyta ^a  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003652460     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0884     Document Type: Article

References (8)

1. N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithm 7 (1986), 567-583.
2. P. Beame and M. Luby, Parallel search for maximal independence given minimal dependence, in "Proceedings of the First SODA Conference, 1990," pp. 212-218.
3. E. Dahlhaus, M. Karpiński, and P. Kelsen, An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3, Inform. Process. Lett. 42 (1992), 309-313.
4. M. Goldberg, and T. Spencer, Constructing a maximal independent set in parallel, SIAM J. Discrete Math. 1 (1989), 322-328.
5. R. Karp and V. Ramachandran, in "Handbook of Theoretical Computer Science," (J. Van Leeuwen, Ed.), pp. 869-941, North-Holland, Amsterdam, 1990.
6. R. Karp and A. Wigderson, A fast parallel algorithm for the maximal independent set problem, in "Proceedings of the 16th ACM Symposium on Theory of Computing, 1984," pp. 266-272.
7. P. Kelsen, On the parallel complexity of computing a maximal independent set in a hypergraph, in "Proceedings of the 24th ACM Symposium on Theory of Computing, 1992."
8. M. Luby, A simply parallel algorithm for the maximal independent set problem, SIAM J. Comput. 15 (1986), 1036-1053.