Graph anonymization through edge and vertex addition
With an abundance of social network data being released, the need to protect sensitive information within these networks has become an important concern of data publishers. In this thesis we focus on the popular notion of k-anonymization as applied to social network graphs. Given such a network N, t...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/3755 |