The following pages link to (Q3138895):
Displayed 5 items.
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086) (← links)
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- On Subgraphs of Bounded Degeneracy in Hypergraphs (Q3181066) (← links)
- Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set (Q4972690) (← links)