The complexity of degree anonymization by vertex addition

Robert Bredereck; Vincent Froese; Sepp Hartung; André Nichterlein; Rolf Niedermeier; Nimrod Talmon

doi:10.1007/978-3-319-07956-1_5

The complexity of degree anonymization by vertex addition

Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

12 Scopus citations

Abstract

Motivated by applications in privacy-preserving data publishing, we study the problem of making an undirected graph k-anonymous by adding few vertices (together with incident edges). That is, after adding these "dummy vertices", for every vertex degree d in the resulting graph, there shall be at least k vertices with degree d. We explore three variants of vertex addition (justified by real-world considerations) and study their (parameterized) computational complexity. We derive mostly (worst-case) intractability results, even for very restricted cases (including trees or bounded-degree graphs) but also obtain a few encouraging fixed-parameter tractability results.

Original language	English
Title of host publication	Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Proceedings
Publisher	Springer Verlag
Pages	44-55
Number of pages	12
ISBN (Print)	9783319079554
DOIs	https://doi.org/10.1007/978-3-319-07956-1_5
State	Published - 1 Jan 2014
Externally published	Yes
Event	10th International Conference on Algorithmic Aspects of Information and Management, AAIM 2014 - Vancouver, BC, Canada Duration: 8 Jul 2014 → 11 Jul 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8546 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th International Conference on Algorithmic Aspects of Information and Management, AAIM 2014
Country/Territory	Canada
City	Vancouver, BC
Period	8/07/14 → 11/07/14

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-07956-1_5

Cite this

Bredereck, R., Froese, V., Hartung, S., Nichterlein, A., Niedermeier, R., & Talmon, N. (2014). The complexity of degree anonymization by vertex addition. In Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Proceedings (pp. 44-55). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8546 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-07956-1_5

Bredereck, Robert ; Froese, Vincent ; Hartung, Sepp et al. / The complexity of degree anonymization by vertex addition. Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Proceedings. Springer Verlag, 2014. pp. 44-55 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{a450fcbefa9f472eabe22caf94e9be09,

title = "The complexity of degree anonymization by vertex addition",

abstract = "Motivated by applications in privacy-preserving data publishing, we study the problem of making an undirected graph k-anonymous by adding few vertices (together with incident edges). That is, after adding these {"}dummy vertices{"}, for every vertex degree d in the resulting graph, there shall be at least k vertices with degree d. We explore three variants of vertex addition (justified by real-world considerations) and study their (parameterized) computational complexity. We derive mostly (worst-case) intractability results, even for very restricted cases (including trees or bounded-degree graphs) but also obtain a few encouraging fixed-parameter tractability results.",

author = "Robert Bredereck and Vincent Froese and Sepp Hartung and Andr{\'e} Nichterlein and Rolf Niedermeier and Nimrod Talmon",

year = "2014",

month = jan,

day = "1",

doi = "10.1007/978-3-319-07956-1_5",

language = "English",

isbn = "9783319079554",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "44--55",

booktitle = "Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Proceedings",

address = "Germany",

note = "10th International Conference on Algorithmic Aspects of Information and Management, AAIM 2014 ; Conference date: 08-07-2014 Through 11-07-2014",

}

Bredereck, R, Froese, V, Hartung, S, Nichterlein, A, Niedermeier, R & Talmon, N 2014, The complexity of degree anonymization by vertex addition. in Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8546 LNCS, Springer Verlag, pp. 44-55, 10th International Conference on Algorithmic Aspects of Information and Management, AAIM 2014, Vancouver, BC, Canada, 8/07/14. https://doi.org/10.1007/978-3-319-07956-1_5

The complexity of degree anonymization by vertex addition. / Bredereck, Robert; Froese, Vincent; Hartung, Sepp et al.
Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Proceedings. Springer Verlag, 2014. p. 44-55 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8546 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The complexity of degree anonymization by vertex addition

AU - Bredereck, Robert

AU - Froese, Vincent

AU - Hartung, Sepp

AU - Nichterlein, André

AU - Niedermeier, Rolf

AU - Talmon, Nimrod

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Motivated by applications in privacy-preserving data publishing, we study the problem of making an undirected graph k-anonymous by adding few vertices (together with incident edges). That is, after adding these "dummy vertices", for every vertex degree d in the resulting graph, there shall be at least k vertices with degree d. We explore three variants of vertex addition (justified by real-world considerations) and study their (parameterized) computational complexity. We derive mostly (worst-case) intractability results, even for very restricted cases (including trees or bounded-degree graphs) but also obtain a few encouraging fixed-parameter tractability results.

AB - Motivated by applications in privacy-preserving data publishing, we study the problem of making an undirected graph k-anonymous by adding few vertices (together with incident edges). That is, after adding these "dummy vertices", for every vertex degree d in the resulting graph, there shall be at least k vertices with degree d. We explore three variants of vertex addition (justified by real-world considerations) and study their (parameterized) computational complexity. We derive mostly (worst-case) intractability results, even for very restricted cases (including trees or bounded-degree graphs) but also obtain a few encouraging fixed-parameter tractability results.

UR - http://www.scopus.com/inward/record.url?scp=84903939850&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-07956-1_5

DO - 10.1007/978-3-319-07956-1_5

M3 - Conference contribution

AN - SCOPUS:84903939850

SN - 9783319079554

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 44

EP - 55

BT - Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Proceedings

PB - Springer Verlag

T2 - 10th International Conference on Algorithmic Aspects of Information and Management, AAIM 2014

Y2 - 8 July 2014 through 11 July 2014

ER -

Bredereck R, Froese V, Hartung S, Nichterlein A, Niedermeier R, Talmon N. The complexity of degree anonymization by vertex addition. In Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Proceedings. Springer Verlag. 2014. p. 44-55. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-07956-1_5

The complexity of degree anonymization by vertex addition

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this