Search Results for author: Lucas Gnecco

Found 1 papers, 0 papers with code

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]

no code implementations30 Jul 2021 Lucas Gnecco, Nicolas Boria, Sébastien Bougleux, Florian Yger, David B. Blumenthal

The inference of minimum spanning arborescences within a set of objects is a general problem which translates into numerous application-specific unsupervised learning tasks.

Cannot find the paper you are looking for? You can Submit a new open access paper.