Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:45, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiently enumerating hitting sets of hypergraphs arising in data profiling |
scientific article |
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
