A refined complexity analysis of degree anonymization in graphs (Q2347809)
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: A refined complexity analysis of degree anonymization in graphs |
scientific article; zbMATH DE number 6444010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A refined complexity analysis of degree anonymization in graphs |
scientific article; zbMATH DE number 6444010 |
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
1.0000001
0 references
0.9598649
0 references
0.9598649
0 references
0.9330742
0 references
0.9330742
0 references
0.9196671
0 references
0.91280425
0 references
0.9104047
0 references
