The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections.

Lucas Gnecco, Nicolas Boria, Sbastien Bougleux, Florian Yger, David B. Blumenthal

Browse the full SISAP paper archive.