Pages that link to "Item:Q1198086"
From MaRDI portal
The following pages link to An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086):
Displaying 4 items.
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189) (← 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)
