作者: Xuesong Lu , Yi Song , Stéphane Bressan
DOI: 10.1007/978-3-642-32600-4_21
关键词:
摘要: Liu and Terzi proposed the notion of k-degree anonymity to address problem identity anonymization in graphs. A graph is anonymous if only each its vertices has same degree as that of, at least, k-1 other vertices. The transform a non-k-degree into by adding or deleting minimum number edges.