Pages that link to "Item:Q1350189"
From MaRDI portal
The following pages link to A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189):
Displaying 5 items.
- A simple proof that finding a maximal independent set in a graph is in NC (Q834937) (← 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)
- Simulating (log <sup>c</sup> <i>n</i> )-wise independence in NC (Q4302863) (← links)
- Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set (Q4972690) (← links)