The complexity of degree anonymization by vertex addition☆
Under an Elsevier user license
open archive
Keywords
Graph modification
Degree-constrained editing
NP-hardness
Parameterized complexity
Fixed-parameter tractability
Kernelization
Cited by (0)
Copyright © 2015 Elsevier B.V. All rights reserved.