The complexity of degree anonymization by vertex addition (Q897957): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q62039078, #quickstatements; #temporary_batch_1707252663060 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:32, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of degree anonymization by vertex addition |
scientific article |
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
