Skip to content

Latest commit

 

History

History
9 lines (7 loc) · 413 Bytes

README.md

File metadata and controls

9 lines (7 loc) · 413 Bytes

what is k-anonymity

The relationship between the points in the original image can be hidden by modifying the edges and modifying the points. For any point in the graph, there are at least m (m>k-1) points whose degrees are equal to this point ahter k-anonymity.

classical-k-anonymity

translate the anonymity function for studying

orignal code is here

https://github.com/blextar/graph-k-degree-anonymity