18 citations · 19 across the 4 of their papers we have counts for
4 papers
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…
Improved local search for graph edit distance
Nicolas Boria, David B. Blumenthal, Sébastien Bougleux +1
The graph edit distance (GED) measures the dissimilarity between two graphs as the minimal cost of a sequence of elementary operations transforming one graph into another. This mea…
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.…
A Greedy Approach to Answer Reachability Queries on DAGs
Nicolas Boria, Gianpiero Cabodi, Paolo Camurati +3
Several modern applications involve huge graphs and require fast answers to reachability queries. In more than two decades since first proposals, several approaches have been prese…