Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2908441505 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:07, 19 March 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