$$\varvec{\textit{KDVEM}}$$KDVEM: a $$k$$k-degree anonymity with vertex and edge modification algorithm

[1]  Tinghuai Ma,et al.  Detect structural‐connected communities based on BSCHEF in C‐DBLP , 2016, Concurr. Comput. Pract. Exp..

[2]  Xiangbin Yan,et al.  Information disclosure on social networking sites: An intrinsic-extrinsic motivation perspective , 2015, Comput. Hum. Behav..

[3]  H. Raghav Rao,et al.  Extent of private information disclosure on online social networks: An exploration of Facebook mobile phone users , 2013, Comput. Hum. Behav..

[4]  B. M. Kapron,et al.  Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes , 2013, Social Network Analysis and Mining.

[5]  Bin Gu,et al.  Feasibility and Finite Convergence Analysis for Accurate On-Line $\nu$-Support Vector Machine , 2013, IEEE Transactions on Neural Networks and Learning Systems.

[6]  Xuesong Lu,et al.  Fast Identity Anonymization on Graphs , 2012, DEXA.

[7]  Jon M. Kleinberg,et al.  Wherefore art thou R3579X? , 2011, Commun. ACM.

[8]  Jia Liu,et al.  K-isomorphism: privacy preserving network publication against structural attacks , 2010, SIGMOD Conference.

[9]  Yanghua Xiao,et al.  k-symmetry model for identity anonymization in social networks , 2010, EDBT '10.

[10]  Lei Zou,et al.  K-Automorphism: A General Framework For Privacy Preserving Network Publication , 2009, Proc. VLDB Endow..

[11]  Alina Campan,et al.  Data and Structural k-Anonymity in Social Networks , 2009, PinKDD.

[12]  Vitaly Shmatikov,et al.  De-anonymizing Social Networks , 2009, 2009 30th IEEE Symposium on Security and Privacy.

[13]  Daniel J. Brass,et al.  Network Analysis in the Social Sciences , 2009, Science.

[14]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[15]  Donald F. Towsley,et al.  Resisting structural re-identification in anonymized social networks , 2008, The VLDB Journal.

[16]  K. Liu,et al.  Towards identity anonymization on graphs , 2008, SIGMOD Conference.

[17]  Jian Pei,et al.  Preserving Privacy in Social Networks Against Neighborhood Attacks , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[18]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[19]  Ninghui Li,et al.  t-Closeness: Privacy Beyond k-Anonymity and l-Diversity , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[20]  ASHWIN MACHANAVAJJHALA,et al.  L-diversity: privacy beyond k-anonymity , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[21]  J. Leskovec,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[22]  M. Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[24]  Sean Chester,et al.  k-Anonymization of Social Networks by Vertex Addition , 2011, ADBIS.

[25]  Siddharth Srivastava,et al.  Anonymizing Social Networks , 2007 .

[26]  Martin Halvey,et al.  WWW '07: Proceedings of the 16th international conference on World Wide Web , 2007, WWW 2007.

[27]  Gábor Csárdi,et al.  The igraph software package for complex network research , 2006 .