The complexity of degree anonymization by graph contractions (Q2407102)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6782886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of degree anonymization by graph contractions |
scientific article; zbMATH DE number 6782886 |
Statements
The complexity of degree anonymization by graph contractions (English)
0 references
28 September 2017
0 references
computational complexity
0 references
parameterized complexity
0 references
fixed-parameter tractability
0 references
privacy
0 references
data publishing
0 references
graph modifications
0 references
degree-constrained editing
0 references
0 references
0.9977784156799316
0 references
0.8806349635124207
0 references
0.8805845379829407
0 references
0.8723770976066589
0 references
0.8721615672111511
0 references
