A Refined Complexity Analysis of Degree Anonymization in Graphs.
Sepp HartungAndré NichterleinRolf NiedermeierOndrej SuchýPublished in: ICALP (2) (2013)
Keyphrases
- complexity analysis
- theoretical analysis
- privacy preserving
- lower bound
- random graphs
- information loss
- search engine
- privacy protection
- graph matching
- graph theory
- first order logic
- weighted graph
- graph structure
- expert systems
- series parallel
- graph construction
- data publishing
- subgraph isomorphism
- data sets
- power law
- graph representation
- bipartite graph
- np complete
- social networks
- neural network