Papers^γ

Furthermore, Apostolico and Drovandi suggest to use $\pi$-code, see Section 4 from [their paper](https://papers-gamma.link/paper/178), when the power law distribution have an exponent close to 1. It actually pushes me to ask, maybe a naive question: is there any standard method to construct such a code when the distribution of the gaps is given or estimated from the data?

Clever algorithm. The java code is [available on the net](https://github.com/drovandi/GraphCompressionByBFS). In 2009, it was almost simultaneously published with [Permuting Web and Social Graphs](https://papers-gamma.link/paper/177) of Boldi et al. At this time it is better than Boldi et al. solution in many cases. The Apostolico-Drovandi paper is mentioned as "The only coordinate-free compression algorithm we are aware of" in [another](https://papers-gamma.link/paper/105) Boldi et al. paper which was published after a while. At that time Boldi et al. provide better results.

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.

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

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.