A refined complexity analysis of degree anonymization in graphs.
Sepp HartungAndré NichterleinRolf NiedermeierOndrej SuchýPublished in: Inf. Comput. (2015)
Keyphrases
- complexity analysis
- theoretical analysis
- lower bound
- privacy preserving
- directed graph
- graph matching
- privacy preservation
- computational complexity
- graph representation
- weighted graph
- graph mining
- graph theoretic
- privacy protection
- information loss
- graph theory
- first order logic
- graph partitioning
- graph databases
- pattern mining
- random graphs
- privacy preserving data publishing
- disclosure control