Finding large degree-anonymous subgraphs is hard

详细信息    查看全文

• 作者：Cristina Bazgan^a ; ¹ ; ^{bazgan@lamsade.dauphine.fr" class="auth_mail" title="E-mail the corresponding author} ; Robert Bredereck^b ; ² ; ^{robert.bredereck@tu-berlin.de" class="auth_mail" title="E-mail the corresponding author} ; Sepp Hartung^b ; ^{sepp.hartung@tu-berlin.de" class="auth_mail" title="E-mail the corresponding author} ; André ; Nichterlein^b ; ^{andre.nichterlein@tu-berlin.de" class="auth_mail" title="E-mail the corresponding author} ; Gerhard J. Woeginger^c ; ³ ; ^{gwoegi@win.tue.nl" class="auth_mail" title="E-mail the corresponding author}
• 关键词：NP-hardness ; Approximation-hardness ; W-hardness ; Graph algorithms
• 刊名：Theoretical Computer Science
• 出版年：2016
• 出版时间：4 April 2016
• 年：2016
• 卷：622
• 期：Complete
• 页码：90-110
• 全文大小：918 K

文摘

A graph is said to be k-anonymous for an integer k  , if for every vertex in the graph there are at least k−1den">de">$k-1$ other vertices with the same degree. We examine the computational complexity of making a given undirected graph k-anonymous either through at most s vertex deletions or through at most s edge deletions; the corresponding problem variants are denoted by Anonym V-Del and Anonym E-Del.

We present a variety of hardness results, most of them hold for both problems. The two variants are intractable from the parameterized as well as from the approximation point of view. In particular, we show that both variants remain NP-hard on very restricted graph classes like trees even if k=2den">de">$k=2$. We further prove that both variants are W[1]-hard with respect to the combined parameter solutions size s and anonymity level k  . With respect to approximability, we obtain hardness results showing that neither variant can be approximated in polynomial time within a factor better than de492f5f991a9f6">den">de">$n^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$2$}\right.}$ (unless P=NPden">de">$\mathrm{P}=\mathrm{NP}$). Furthermore, for the optimization variants where the solution size s is given and the task is to maximize the anonymity level k  , this inapproximability result even holds if we allow a running time of f(s)⋅n^O(1)den">de">$f(s)\cdot n^{\mathcal{O}(1)}$ for any computable function f. On the positive side, we classify both problem variants as fixed-parameter tractable with respect to the combined parameter solution size s and maximum degree Δ.