The complexity of degree anonymization by vertex addition
نویسندگان
چکیده
منابع مشابه
The Complexity of Degree Anonymization by Vertex Addition
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 some incident edges). That is, after adding these “dummy vertices”, for every vertex degree d appearing in the resulting graph, there shall be at least k vertices with degree d. We explore three variants of vertex addition (justifi...
متن کاملk-Anonymization of Social Networks by Vertex Addition
With an abundance of social network data being released, the need to protect sensitive information within these networks has become an important concern of data publishers. In this paper we focus on the popular notion of kanonymization as applied to node degrees in a social network. Given such a network N , the problem we study is to transform N to N , such that the degree of each node in N ′ i...
متن کاملThe Complexity of Degree Anonymization by Graph Contractions
We study the computational complexity of k-anonymizing a given graph by as few graph contractions as possible. A graph is said to be k-anonymous if for every vertex in it, there are at least k − 1 other vertices with exactly the same degree. The general degree anonymization problem is motivated by applications in privacy-preserving data publishing, and was studied to some extent for various gra...
متن کاملA Refined Complexity Analysis of Degree Anonymization in Graphs
Motivated by a strongly growing interest in graph anonymization, we study the NP-hard 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...
متن کاملOn the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion
In this paper, we investigate the approximability of two node deletion problems. Given a vertex weighted graph G = (V,E) and a specified, or “distinguished” vertex p ∈ V , MDD(min) is the problem of finding a minimum weight vertex set S ⊆ V \ {p} such that p becomes the minimum degree vertex in G[V \ S]; and MDD(max) is the problem of finding a minimum weight vertex set S ⊆ V \{p} such that p b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.07.004