Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes
- 26 September 2012
- journal article
- research article
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 3 (3) , 381-399
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Complexity of social network anonymizationSocial Network Analysis and Mining, 2012
- The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacksKnowledge and Information Systems, 2010
- L -diversityACM Transactions on Knowledge Discovery From Data, 2007
- Characterization of complex networks: A survey of measurementsAdvances in Physics, 2007
- Finding community structure in networks using the eigenvectors of matricesPhysical Review E, 2006
- Graph miningACM Computing Surveys, 2006
- Spectral measures of bipartivity in complex networksPhysical Review E, 2005
- Efficient Behavior of Small-World NetworksPhysical Review Letters, 2001
- On power-law relationships of the Internet topologyACM SIGCOMM Computer Communication Review, 1999
- The Minimal Regular Graph Containing a Given GraphThe American Mathematical Monthly, 1963