Comments:

An interested reader may also take a look at [Apostolico-Drovandi](https://www.mdpi.com/1999-4893/2/3/1031/pdf) paper and their [code](https://github.com/drovandi/GraphCompressionByBFS). that often works better than BV framework with some exceptions. Furthermore, in the paper about [Layered Label Propagation](https://papers-gamma.link/paper/105/) Boldi et al. improved their Gray code based order from this paper.
Read the paper, add your comments…

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
Read the paper, add your comments…

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.
Read the paper, add your comments…

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 ?
Read the paper, add your comments…

Comments:

Read the paper, add your comments…
Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42