Pages that link to "Item:Q4373005"
From MaRDI portal
The following pages link to A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph (Q4373005):
Displaying 4 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set (Q4972690) (← links)