The Complexity of Degree Anonymization by Graph Contractions.

Sepp Hartung Nimrod Talmon

Published in: TAMC (2015)

Keyphrases

graph representation
computational complexity
worst case
graph theory
graph structure
random graphs
random walk
connected components
computational cost
directed graph
graph theoretic
privacy preserving
structured data
graph matching
information loss
power law