The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections. - Lucas Gnecco; Nicolas Boria; Sébastien Bougleux; Florian Yger; David B. Blumenthal (SISAP, 2021)

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]. - Lucas Gnecco; Nicolas Boria; Sébastien Bougleux; Florian Yger; David B. Blumenthal (CoRR, 2021)