A refined complexity analysis of degree anonymization in graphs (Q2347809): Difference between revisions
From MaRDI portal
Latest revision as of 04:22, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A refined complexity analysis of degree anonymization in graphs |
scientific article |
Statements
A refined complexity analysis of degree anonymization in graphs (English)
0 references
9 June 2015
0 references
parameterized complexity
0 references
kernelization
0 references
heuristics
0 references
\(f\)-factors
0 references
data privacy
0 references
0 references
0 references