A refined complexity analysis of degree anonymization in graphs (Q5327468)
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 6196364
| 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 6196364 |
Statements
A Refined Complexity Analysis of Degree Anonymization in Graphs (English)
0 references
7 August 2013
0 references
0.982168197631836
0 references
0.9036319255828856
0 references
0.9031608700752258
0 references
0.8873195648193359
0 references
0.8864147067070007
0 references
