☆
1
Comments:
Anonymize graph by adding edges. No lossy compression considered here.
$(k, \ell)$-anonymity is defined in this paper.
See also
* http://theory.stanford.edu/~tomas/
and
* http://theory.stanford.edu/~sunabar/Publications.html
☆
1
Comments:
Another item in our with [aGuyot](https://papers-gamma.link/aGuyot)
library about [Graph anonymization](https://papers-gamma.link/domain/Graph%20anonymization).
One of the authors of this paper, [Paolo Boldi](https://papers-gamma.link/author/Paolo%20Boldi), also created a Boldi-Vigna Webgraph framework.
☆
2
Comments:
Implementation of the push method in C: https://github.com/maxdan94/push
> Implementation of the push method in C: https://github.com/maxdan94/push
Max, do you think there is a something like a typical value of conductance
when we consider some family of real-world graphs ?
Comments: