Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficiently enumerating hitting sets of hypergraphs arising in data profiling |
scientific article; zbMATH DE number 7433362
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiently enumerating hitting sets of hypergraphs arising in data profiling |
scientific article; zbMATH DE number 7433362 |
Statements
Efficiently enumerating hitting sets of hypergraphs arising in data profiling (English)
0 references
25 November 2021
0 references
data profiling
0 references
enumeration algorithm
0 references
minimal hitting set
0 references
transversal hypergraph
0 references
unique column combination
0 references
W[3]-completeness
0 references
0 references
0 references
0 references
0 references
0 references
0 references
