@inproceedings{9f41afe5c0af453c926266c572a02413,
title = "Time-efficient algorithm on degree anonymization by combination of vertex and edge addition",
abstract = "In previous work about privacy preservation of graph modeled network, k-degree-anonymization has been a well-developed subject. We studied various researches on both edge addition and vertex addition. In many algorithms, the edge addition is a heuristic process, which may bring in some extra time cost. Interested in the problem, we introduce the idea of vertex addition, and develop a framework that combines edge addition and vertex addition. We use a greedy idea to add edges in the original graph, and use as least pseudo vertices as possible to produce a k-degree-anonymous graph. The time efficiency of our approach lies on the nature of greed edge addition.",
keywords = "Component, Edge addition, Greedy algorithm, K-anonymous graph, Privacy, Vertex addition",
author = "Tong Wu and Chao Peng",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 11th IEEE International Conference on Anti-Counterfeiting, Security, and Identification, ASID 2017 ; Conference date: 27-10-2017 Through 29-10-2017",
year = "2017",
month = jul,
day = "2",
doi = "10.1109/ICASID.2017.8285735",
language = "英语",
series = "Proceedings of the International Conference on Anti-Counterfeiting, Security and Identification, ASID",
publisher = "IEEE Computer Society",
pages = "16--20",
editor = "Jianyang Zhou and Donghui Guo and Jiyang Dong",
booktitle = "Proceedings of 2017 11th IEEE International Conference on Anti-Counterfeiting, Security, and Identification, ASID 2017",
address = "美国",
}