• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Finding large degree-anonymous subgraphs is hard

Thumbnail
Date
2016
Dewey
Recherche opérationnelle
Sujet
Complexity; NP-hardness; Approximation-hardness; W-hardness; Graph algorithms
JEL code
C.C4.C44
Journal issue
Theoretical Computer Science
Volume
622
Publication date
04-2016
Article pages
90-110
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.tcs.2016.02.004
URI
https://basepub.dauphine.fr/handle/123456789/16142
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Bazgan, Cristina
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Bredereck, Robert
84325 Department of Software Engineering and Theoretical Computer Science [SWT - TUB]
Hartung, Sepp
84325 Department of Software Engineering and Theoretical Computer Science [SWT - TUB]
Nichterlein, André
84325 Department of Software Engineering and Theoretical Computer Science [SWT - TUB]
Woeginger, Gerhard
238519 Department of mathematics and computing science [Eindhoven]
Type
Article accepté pour publication ou publié
Abstract (EN)
A graph is said to be k-anonymous for an integer k, if for every vertex in the graph there are at least k−1k−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=2k=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 View the MathML sourcen12 (unless P=NPP=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)⋅nO(1)f(s)⋅nO(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 Δ.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.