G. Cormode, D. Srivastava, T. Yu, and Q. Zhang, Anonymizing bipartite graph data using safe groupings, The VLDB Journal, vol.10, issue.5, pp.115-139, 2010.
DOI : 10.1007/s00778-009-0167-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.7895

A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, -diversity, ACM Transactions on Knowledge Discovery from Data, vol.1, issue.1, 2007.
DOI : 10.1145/1217299.1217302

M. Hay, G. Miklau, D. Jensen, D. Towsley, and C. Li, Resisting structural re-identification in anonymized social networks, The VLDB Journal, vol.2, issue.1, pp.797-823, 2010.
DOI : 10.1007/s00778-010-0210-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.6866

P. Massa and P. Avesani, Trust-aware bootstrapping of recommender systems, In: ECAI. Citeseer, vol.6, pp.29-33, 2006.

S. Bhagat, G. Cormode, B. Krishnamurthy, and D. Srivastava, Class-based graph anonymization for social network data, Proceedings of the VLDB Endowment, pp.766-777, 2009.
DOI : 10.14778/1687627.1687714
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.7966

L. Sweeney, k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol.2, issue.3, pp.557-570, 2002.
DOI : 10.1109/RISP.1993.287632

B. Zhou and J. Pei, Preserving Privacy in Social Networks Against Neighborhood Attacks, 2008 IEEE 24th International Conference on Data Engineering, pp.506-515, 2008.
DOI : 10.1109/ICDE.2008.4497459
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.1559

L. Zou, L. Chen, and M. T. Ozsu, k-automorphism, Proc. VLDB Endow, pp.946-957, 2009.
DOI : 10.14778/1687627.1687734

J. Cheng, A. Fu, and J. Liu, K-isomorphism, Proceedings of the 2010 international conference on Management of data, SIGMOD '10, pp.459-470, 2010.
DOI : 10.1145/1807167.1807218

S. Hanhijärvi, G. C. Garriga, and K. Puolamäki, Randomization Techniques for Graphs, Proceedings of the 9th SIAM International Conference on Data Mining (SDM '09, pp.780-791, 2009.
DOI : 10.1137/1.9781611972795.67

X. Ying and X. Wu, Randomizing Social Networks: a Spectrum Preserving Approach, In: SDM, pp.739-750, 2008.
DOI : 10.1137/1.9781611972788.67
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.6647

X. Ying and X. Wu, Graph Generation with Prescribed Feature Constraints, In: SDM, pp.966-977, 2009.
DOI : 10.1137/1.9781611972795.83
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.5091

S. Russell and P. Norvig, Artificial intelligence: A modern approach, p.15, 2003.

E. Zheleva and L. Getoor, Preserving the Privacy of Sensitive Relationships in Graph Data, Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD, pp.153-171, 2007.
DOI : 10.1007/978-3-540-78478-4_9

L. Liu, J. Wang, J. Liu, and J. Zhang, Privacy Preservation in Social Networks with Sensitive Edge Weights, SIAM International Conference on Data Mining, pp.954-965, 2009.
DOI : 10.1137/1.9781611972795.82
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.4341

S. Das, ¨. O. Egecioglu, and A. Abbadi, Anonymizing edge-weighted social network graphs, Computer Science, pp.2009-2012, 2009.
DOI : 10.1109/icde.2010.5447915
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.5829