A Refined Complexity Analysis of Degree Anonymization in Graphs

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F15%3A00237629" target="_blank" >RIV/68407700:21240/15:00237629 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.ic.2014.12.017" target="_blank" >http://dx.doi.org/10.1016/j.ic.2014.12.017</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ic.2014.12.017" target="_blank" >10.1016/j.ic.2014.12.017</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A Refined Complexity Analysis of Degree Anonymization in Graphs

Popis výsledku v původním jazyce

Motivated by a strongly growing interest in graph anonymization in the data mining and databases communities, we study the NP-hard textsc{Degree Anonymity} problem asking whether a graph can be made $k$-anonymous by adding at most a given number of edges. 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 if ``many'' edges need to be added. Based on this, we develop a polynomial-time data reduction yielding a polynomial-size problem kernel for textsc{Degree Anonymity} parameterized by themaximum vertex degree. In terms of parameterized complexity analysis, 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 d

Název v anglickém jazyce

A Refined Complexity Analysis of Degree Anonymization in Graphs

Popis výsledku anglicky

Motivated by a strongly growing interest in graph anonymization in the data mining and databases communities, we study the NP-hard textsc{Degree Anonymity} problem asking whether a graph can be made $k$-anonymous by adding at most a given number of edges. 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 if ``many'' edges need to be added. Based on this, we develop a polynomial-time data reduction yielding a polynomial-size problem kernel for textsc{Degree Anonymity} parameterized by themaximum vertex degree. In terms of parameterized complexity analysis, 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 d

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Information and Computation

ISSN

0890-5401

e-ISSN

—

Svazek periodika

243

Číslo periodika v rámci svazku

August

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

14

Strana od-do

249-262

Kód UT WoS článku

000355665500016

EID výsledku v databázi Scopus

2-s2.0-84938056647