Efficient algorithms for dualizing large-scale hypergraphs (Q2449091): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.01.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2788537315 / rank | |||
Normal rank | |||
Revision as of 23:22, 19 March 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
