Login / Signup
On the Complexity of Optimal k-Anonymity: A New Proof Based on Graph Coloring.
Yavuz Canbay
Published in:
IEEE Access (2024)
Keyphrases
</>
graph coloring
worst case
privacy preserving
np complete problems
phase transition
combinatorial problems
computational complexity
job shop scheduling
scheduling problem
information loss
space complexity
privacy protection
optimal solution
dynamic programming
upper bound
decision problems