A fast graph modification method for social network anonymization

作者：

Highlights：

• The challenge of algorithm runtime has been addressed.

• The graph modification step of the algorithm is focused.

• The proposed algorithm has two steps of adding and deleting edges.

• It uses an efficient algorithm to select the most appropriate edges.

• It improves the algorithm runtime and the utility of the graph.

摘要

•The challenge of algorithm runtime has been addressed.•The graph modification step of the algorithm is focused.•The proposed algorithm has two steps of adding and deleting edges.•It uses an efficient algorithm to select the most appropriate edges.•It improves the algorithm runtime and the utility of the graph.

论文关键词：Privacy,Graph modification,Graph utility,NaFa,Number factorization

论文评审过程：Received 31 March 2020, Revised 26 April 2021, Accepted 29 April 2021, Available online 4 May 2021, Version of Record 12 May 2021.

论文官网地址：https://doi.org/10.1016/j.eswa.2021.115148