Login / Signup
Comparing Random-Based and k-Anonymity-Based Algorithms for Graph Anonymization.
Jordi Casas-Roma
Jordi Herrera-Joancomartí
Vicenç Torra
Published in:
MDAI (2012)
Keyphrases
</>
privacy preserving
information loss
graph theory
random walk
original data
bipartite graph
graph representation
privacy protection
depth first search