张晓琳, 王萍, 郭彦磊, 等. 社会网络子集个性化隐私保护策略[J]. 计算机应用, 2015, 32(10) : 3026-3035. DOI: 3026

Malewicz G, Austern M, Bik A, et al. Pregel: a system forlarge-scale graph processing[C]//Proc of the 2010 SIGMOD International Conference on Management of data. New York: ACM, 2010: 135-146.

Fard A, Wang K, Yu P. Limiting link disclosure in social network analysis through subgraph-wise perturbation[C]//Proc of the 2012 EDBT International Conference on Extending DB Technology. New York: ACM, 2012: 109-119.

Salihoglu S, Widom J. Optimizing graph algorithms on pregel-like systems[J]. Proceedings of the Vldb Endowment, 2014, 7(7): 577-588. DOI: 577

Zhang L, Zhang W. Edge anonymity in aocial network graphs[C]// Proc of the 2009 International Conference on Computational Science and Engineering. Washington, DC: IEEE, 2009: 1-8.

Munmun B, Mani P. Preserving privacy in social network graph with k-anonymize degree sequence Generation[C]//Proc of the 2015 SKIMA International Conference on Software, Knowledge on Information Management and Application. Kathmandu: IEEE, 2015: 1-7.

Ying X, Wu X. Randomizing social networks: a spectrum preserving approach[C]//Proc of the 2008 International Conference on Data Mining. Atlanta: SIAM, 2008: 739-750.

Ford A, Wang K. Neighborhood randomization for link privacy in social network analysis[J]. World Wide Web-internet % Web Information Systems, 2013, 18(1) : 9-32. DOI: 9