The complexity of degree anonymization by graph contractions.

Nimrod Talmon Sepp Hartung

Published in: Inf. Comput. (2017)

Keyphrases

graph theory
privacy preserving
directed graph
space complexity
random graphs
graph mining
causal graph
computational complexity
graph theoretic
privacy protection
graph representation
graph model
information loss
directed acyclic graph
link analysis
graph structure
decision problems