A refined complexity analysis of degree anonymization in graphs (Q2347809): 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.ic.2014.12.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051603732 / rank | |||
Normal rank | |||
Revision as of 20:27, 19 March 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
