A Refined Complexity Analysis of Identity Anonymization on Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F13%3A00209346" target="_blank" >RIV/68407700:21240/13:00209346 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-642-39212-2_52" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-39212-2_52</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-39212-2_52" target="_blank" >10.1007/978-3-642-39212-2_52</a>
Alternative languages
Result language
angličtina
Original language name
A Refined Complexity Analysis of Identity Anonymization on Graphs
Original language description
Motivated by a strongly growing interest in graph anonymization in the data mining and databases communities, we study the NP-hard problem of making a graph k-anonymous by adding as few edges as possible. Herein, a graph is k-anonymous if for every vertex in the graph there are at least k - 1 other vertices of the same degree. Our algorithmic results shed light on the performance quality of a popular heuristic due to Liu and Terzi [ACM SIGMOD 2008]; in particular, we show that the heuristic provides optimal solutions in case that many edges need to be added. Based on this, we develop a polynomial-time data reduction, yielding a polynomial-size problem kernel for the problem parameterized by the maximum vertex degree. This result is in a sense tight since we also show that the problem is already NP-hard for H-index three, implying NP-hardness for smaller parameters such as average degree and degeneracy.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISBN
978-3-642-39211-5
ISSN
0302-9743
e-ISSN
—
Number of pages
13
Pages from-to
594-606
Publisher name
Springer Science+Business Media
Place of publication
Berlin
Event location
Riga
Event date
Jul 8, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—