arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0810.5578cs.DBcs.DS
收藏

图的分析

Anonymizing Graphs

Tomas Feder, Shubha U. Nabar, Evimaria Terzi

摘要:

最近发现的隐私攻击社交网络的动机,我们研究的问题,匿名化的基础图形的互动在社交网络。我们称一个图为(k,l)-匿名的,如果对于图中的每个节点,至少存在k个共享至少l个邻居的其他节点。我们考虑两个组合的问题,从这个概念的匿名图。更具体地说,给定一个输入图,我们要求添加最少数量的边,使图成为(k,l)-匿名。我们定义了这个最小化问题的两个变种,并研究它们的性质。我们表明,对于某些值的k和l的问题是多项式时间可解的,而对于其他人,他们成为NP-难。对于后一种情况,也给出了近似算法。

英文摘要:

Motivated by recently discovered privacy attacks on social networks, we study the problem of anonymizing the underlying graph of interactions in a social network. We call a graph (k,l)-anonymous if for every node in the graph there exist at least k other nodes that share at least l of its neighbors. We consider two combinatorial problems arising from this notion of anonymity in graphs. More specifically, given an input graph we ask for the minimum number of edges to be added so that the graph becomes (k,l)-anonymous. We define two variants of this minimization problem and study their properties. We show that for certain values of k and l the problems are polynomial-time solvable, while for others they become NP-hard. Approximation algorithms for the latter cases are also given.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑