A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph
From MaRDI portal
Publication:4373005
DOI10.1006/jagm.1997.0884zbMath0887.68048MaRDI QIDQ4373005
Edyta Szymańska, Tomasz Łuczak
Publication date: 25 May 1998
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1997.0884
Related Items
Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set, On vertex independence number of uniform hypergraphs, A global parallel algorithm for the hypergraph transversal problem, On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs