Pages that link to "Item:Q2802949"
From MaRDI portal
The following pages link to Faster Algorithms to Enumerate Hypergraph Transversals (Q2802949):
Displaying 9 items.
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- An average study of hypergraphs and their minimal transversals (Q2355712) (← links)
- Counting Minimal Dominating Sets (Q2988832) (← links)
- Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
- Computing and Combinatorics (Q5716999) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
- Algorithms - ESA 2003 (Q5897277) (← links)