Efficient algorithms for dualizing large-scale hypergraphs (Q2449091): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:14, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for dualizing large-scale hypergraphs |
scientific article |
Statements
Efficient algorithms for dualizing large-scale hypergraphs (English)
0 references
6 May 2014
0 references
dualization
0 references
hypergraph transversal
0 references
minimal hitting set
0 references
minimal set covering
0 references
enumeration
0 references
experimental efficiency
0 references
real-world data
0 references
