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