{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T17:58:52Z","timestamp":1781891932248,"version":"3.54.5"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T00:00:00Z","timestamp":1348617600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s13278-012-0084-6","type":"journal-article","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T17:39:26Z","timestamp":1348594766000},"page":"381-399","source":"Crossref","is-referenced-by-count":52,"title":["Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes"],"prefix":"10.1007","volume":"3","author":[{"given":"Sean","family":"Chester","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruce M.","family":"Kapron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ganesh","family":"Ramesh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gautam","family":"Srivastava","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Venkatesh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,9,26]]},"reference":[{"key":"84_CR1","doi-asserted-by":"crossref","unstructured":"Adamic L, Glance N (2005) The political blogosphere and the 2004 u.s. election: divided they blog. In: Proceedings of WWW 2005 workshop on the weblogging ecosystem","DOI":"10.1145\/1134271.1134277"},{"key":"84_CR2","unstructured":"Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A (2005) Anonymizing tables. In: Proceedings of international conference on database theory (ICDT), pp 246\u2013258"},{"key":"84_CR3","first-page":"15","volume":"83","author":"J Akiyama","year":"1983","unstructured":"Akiyama J, Era H, Harary F (1983) Regular graphs containing a given graph. Am Math Month 83:15\u201317","journal-title":"Am Math Month"},{"key":"84_CR4","doi-asserted-by":"crossref","unstructured":"Backstrom L, Dwork C, Kleinberg JM (2007) Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of conference on world wide web (WWW), pp 181\u2013190","DOI":"10.1145\/1242572.1242598"},{"key":"84_CR5","doi-asserted-by":"crossref","unstructured":"Barrat A, Weigt M (2000) On the properties of small-world network models. Eur Phys J B 13(3):547\u2013560","DOI":"10.1007\/s100510050067"},{"key":"84_CR6","unstructured":"Bodlaender HL, Tan RB, van Leeuwen J (2000) Finding a delta-regular supergraph of minimum order. Tech Rep UU-CS-2000-29, Dept of Computer Science, Utrecht University, Utrecht"},{"key":"84_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Faloutsos, C (2006) Graph mining: laws, generators, and algorithms. ACM Comput Surv 38(1):2. doi: 10.1145\/1132952.1132954","DOI":"10.1145\/1132952.1132954"},{"key":"84_CR8","doi-asserted-by":"crossref","unstructured":"Cheng J, Fu AWC, Liu J (2010) K-isomorphism: privacy preserving network publication against structural attacks. In: Proceedings of ACM Special Interest Group on Management of Data (SIGMOD), pp 459\u2013470","DOI":"10.1145\/1807167.1807218"},{"key":"84_CR12","doi-asserted-by":"crossref","unstructured":"Chester S, Srivastava G (2011) Social network privacy for attribute disclosure attacks. In: Proceedings of advances in social networks analysis and mining (ASONAM)","DOI":"10.1109\/ASONAM.2011.105"},{"key":"84_CR10","unstructured":"Chester S, Kapron B, Ramesh G, Srivastava G, Thomo A, Venkatesh S (2011) k-anonymization of social networks by vertex addition. In: Proceedings of advances in databases and information systems (ADBIS)"},{"key":"84_CR9","doi-asserted-by":"crossref","unstructured":"Chester S, Gaertner J, Stege U, Venkatesh S (2012a) Anonymizing subsets of social networks with degree constrained subgraphs. In: Proceedings of advances in social networks analysis and mining (ASONAM)","DOI":"10.1109\/ASONAM.2012.74"},{"key":"84_CR11","doi-asserted-by":"crossref","unstructured":"Chester S, Kapron B, Srivastava G, Venkatesh S (2012b) Complexity of social network anonymization. Soc Netw Anal Min. doi: 10.1007\/s13278-012-0059-7","DOI":"10.1007\/s13278-012-0059-7"},{"key":"84_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1080\/00018730601170527","volume":"56","author":"LdF Costa","year":"2007","unstructured":"Costa LdF, Rodrigues FA, Travieso G, Villas Boas PR (2007) Characterization of complex networks: a survey of measurements. Adv Phys 56:167\u2013242","journal-title":"Adv Phys"},{"key":"84_CR14","doi-asserted-by":"crossref","unstructured":"Domingo-Ferrer J (ed) (2002) Inference Control in statistical databases, from theory to practice. In: Lecture Notes in Computer Science, vol 2316. Springer, Berlin","DOI":"10.1007\/3-540-47804-3"},{"key":"84_CR15","doi-asserted-by":"crossref","unstructured":"Dwork C (2006) Differential privacy. In: ICALP. Springer, Berlin, pp 1\u201312","DOI":"10.1007\/11787006_1"},{"key":"84_CR16","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.2307\/2312837","volume":"70","author":"P Erd\u0151s","year":"1967","unstructured":"Erd\u0151s P, Kelly P (1967) The minimal regular graph containing a given graph. Am Math Month 70:1074\u20131075","journal-title":"Am Math Month"},{"key":"84_CR17","doi-asserted-by":"crossref","unstructured":"Estrada E, Rodriguez-Velazquez JA (2005) Spectral measures of bipartivity in complex networks. Phys Rev E 72(4):046105. doi: 10.1103\/PhysRevE.72.046105","DOI":"10.1103\/PhysRevE.72.046105"},{"issue":"4","key":"84_CR18","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316194.316229","volume":"29","author":"M Faloutsos","year":"1999","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. SIGCOMM Comput Commun Rev 29(4):251\u2013262. doi: 10.1145\/316194.316229","journal-title":"SIGCOMM Comput Commun Rev"},{"issue":"2","key":"84_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s13278-011-0038-4","volume":"2","author":"F Ferri","year":"2012","unstructured":"Ferri F, Grifoni P, Guzzo T (2012) New forms of social and professional digital relationships: the case of facebook. Soc Netw Anal Min 2(2):121\u2013137","journal-title":"Soc Netw Anal Min"},{"key":"84_CR20","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99:7821\u20137826","journal-title":"Proc Natl Acad Sci USA"},{"key":"84_CR21","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez JJS (2002) Extending cell suppression to protect tabular data against several attackers. In: Inference Control in Statistical Databases, pp 34\u201358","DOI":"10.1007\/3-540-47804-3_4"},{"issue":"1","key":"84_CR22","first-page":"102","volume":"1","author":"M Hay","year":"2008","unstructured":"Hay M, Miklau G, Jensen D, Towsley DF, Weis P (2008) Resisting structural re-identification in anonymized social networks. Proc Very Large Datab 1(1):102\u2013114","journal-title":"Proc Very Large Datab"},{"key":"84_CR23","doi-asserted-by":"crossref","unstructured":"Heer J (2005) Prefuse: a toolkit for interactive information visualization. In: CHI 05: Proceedings of the SIGCHI conference on human factors in computing systems. ACM Press, New York, pp 421\u2013430","DOI":"10.1145\/1054972.1055031"},{"key":"84_CR24","unstructured":"K\u00f6nig D (1936) Akademische verlagsgesellschaft. Leipzig"},{"key":"84_CR25","doi-asserted-by":"crossref","unstructured":"Latora V, Marchiori M (2001) Efficient behavior of small-world networks. Phys Rev Lett 87. doi: 10.1103\/PhysRevLett.87.198701","DOI":"10.1103\/PhysRevLett.87.198701"},{"key":"84_CR26","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: Densification laws, shrinking diameters and possible explanations. In: Proceedings of international conference on knowledge discovery and data mining (KDD)","DOI":"10.1145\/1081870.1081893"},{"key":"84_CR27","doi-asserted-by":"crossref","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2008) Statistical properties of community structure in large social and information networks. In: Proceedings of conference on world wide web (WWW), pp 695\u2013704","DOI":"10.1145\/1367497.1367591"},{"key":"84_CR28","doi-asserted-by":"crossref","unstructured":"Li N, Li T, Venkatasubramanian S (2007) t-closeness: privacy beyond k-anonymity and l-diversity. In: Proceedings of of IEEE 23rd international conference on data engineering (ICDE07)","DOI":"10.1109\/ICDE.2007.367856"},{"key":"84_CR29","doi-asserted-by":"crossref","unstructured":"Liu K, Terzi E (2008) Towards identity anonymization on graphs. In: Proceedings of ACM Special Interest Group on Management of Data (SIGMOD), pp 93\u2013106","DOI":"10.1145\/1376616.1376629"},{"key":"84_CR30","doi-asserted-by":"crossref","unstructured":"Machanavajjhala A, Kifer D, Gehrke J, Venkitasubramaniam M (2007) L-diversity: Privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data 1(1). doi: 10.1145\/1217299.1217302","DOI":"10.1145\/1217299.1217302"},{"key":"84_CR31","doi-asserted-by":"crossref","unstructured":"McSherry F, Mironov I (2009) Differentially private recommender systems: building privacy into the netflix prize contenders. In: Proceedings of international conference on knowledge discovery and data mining (KDD), pp 627\u2013636","DOI":"10.1145\/1557019.1557090"},{"key":"84_CR32","doi-asserted-by":"crossref","unstructured":"Meyerson A, Williams R (2004) On the complexity of optimal k-anonymity. In: Principles of database systems, pp 223\u2013228","DOI":"10.1145\/1055558.1055591"},{"key":"84_CR33","first-page":"60","volume":"2","author":"S Milgram","year":"1967","unstructured":"Milgram S (1967) The small world problem. Psychol Today 2:60\u201367","journal-title":"Psychol Today"},{"key":"84_CR34","doi-asserted-by":"crossref","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3). doi: 10.1103\/PhysRevE.74.036104","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"84_CR35","unstructured":"Robertson DA, Ethier R (2002) Cell suppression: experience and theory. In: Inference control in statistical databases, pp 8\u201320"},{"issue":"5","key":"84_CR36","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) k-anonymity: A model for protecting privacy. Int J Uncertainty Fuzziness Knowl Based Syst 10(5):557\u2013570","journal-title":"Int J Uncertainty Fuzziness Knowl Based Syst"},{"key":"84_CR37","doi-asserted-by":"crossref","unstructured":"Thompson B, Yao D (2009) The union-split algorithm and cluster-based anonymization of social networks. In: Proceedings of ACM symposium on information, computer and communications security (ASIACCS), pp 218\u2013227","DOI":"10.1145\/1533057.1533088"},{"key":"84_CR38","doi-asserted-by":"crossref","unstructured":"Wang Y, Xie L, Zheng B, Lee KCK (2011) Utility-oriented k-anonymization on social networks. In: Proceedings of the 16th international conference on Database systems for advanced applications, vol Part I, DASFAA\u201911. Springer, Berlin, pp 78\u201392","DOI":"10.1007\/978-3-642-20149-3_8"},{"key":"84_CR39","doi-asserted-by":"crossref","unstructured":"Wu W, Xiao Y, Wang W, He Z, Wang Z (2010) k-symmetry model for identity anonymization in social networks. In: Proceedings of international conference on extending database technology (EDBT), pp 111\u2013122","DOI":"10.1145\/1739041.1739058"},{"key":"84_CR40","doi-asserted-by":"crossref","unstructured":"Ying X, Pan K, Wu X, Guo L (2009) Comparisons of randomization and k-degree anonymization schemes for privacy preserving social network publishing. In: Proceedings of 3rd workshop on social network mining and analysis (SNA-KDD). ACM, New York, pp 10:1\u201310:10","DOI":"10.1145\/1731011.1731021"},{"issue":"2","key":"84_CR41","first-page":"141","volume":"4","author":"M Yuan","year":"2010","unstructured":"Yuan M, Chen L, Yu PS (2010) Personalized privacy protection in social networks. Proc Very Large Datab 4(2):141\u2013150","journal-title":"Proc Very Large Datab"},{"key":"84_CR42","unstructured":"Zheleva E, Getoor L (2007) Preserving the privacy of sensitive relationships in graph data. In: Proceedings of privacy, security, and trust in KDD (PinKDD), pp 153\u2013171"},{"issue":"1","key":"84_CR43","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10115-010-0311-2","volume":"28","author":"B Zhou","year":"2011","unstructured":"Zhou B, Pei J (2011) The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks. Knowledge Information Systems 28(1):47\u201377","journal-title":"Knowl Inf Syst"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-012-0084-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-012-0084-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-012-0084-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T23:04:27Z","timestamp":1687734267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-012-0084-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,26]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s13278-012-0084-6","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,26]]}}}