1 citations · 1 across the 2 of their papers we have counts for
Showing cs.CVShow all
2 papers · 1 filter
cs.CV2021★ 1 cited
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]
Lucas Gnecco, Nicolas Boria, Sébastien Bougleux +2
The inference of minimum spanning arborescences within a set of objects is a general problem which translates into numerous application-specific unsupervised learning tasks. We int…
cs.CV2019
Generalized Median Graph via Iterative Alternate Minimizations
Nicolas Boria, S'ebastien Bougleux, Benoit Gaüzère +1
Computing a graph prototype may constitute a core element for clustering or classification tasks. However, its computation is an NP-Hard problem, even for simple classes of graphs.…