The complexity of degree anonymization by vertex addition (Q897957)
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: The complexity of degree anonymization by vertex addition |
scientific article; zbMATH DE number 6517485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of degree anonymization by vertex addition |
scientific article; zbMATH DE number 6517485 |
Statements
The complexity of degree anonymization by vertex addition (English)
0 references
8 December 2015
0 references
graph modification
0 references
degree-constrained editing
0 references
NP-hardness
0 references
parameterized complexity
0 references
fixed-parameter tractability
0 references
kernelization
0 references
0 references
0.9994547367095948
0 references
0.9036319255828856
0 references
0.896919846534729
0 references
0.8854862451553345
0 references
0.8805845379829407
0 references
