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

Autor: Gnecco, Lucas, Boria, Nicolas, Bougleux, Sébastien, Yger, Florian, Blumenthal, David B.

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 introduce a unified and generic structure called edit arborescence that r

Externí odkaz: http://arxiv.org/abs/2107.14525

Generalized Median Graph via Iterative Alternate Minimizations

Autor: Boria, Nicolas, Bougleux, S'ebastien, Gaüzère, Benoit, Brun, Luc

Publikováno v: IAPR International workshop on Graph-Based Representation in Pattern Recognition, Donatello Conte, Jean-Yves Ramel, Jun 2019, Tours, France. pp.99-109

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. In this paper, we propose an efficient approach based on block coordi

Externí odkaz: http://arxiv.org/abs/1906.11009

A Greedy Approach to Answer Reachability Queries on DAGs

Autor: Boria, Nicolas, Cabodi, Gianpiero, Camurati, Paolo, Palena, Marco, Pasini, Paolo, Quer, Stefano

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 presented adopting on-line searches, hop labelling or transitive closure co

Externí odkaz: http://arxiv.org/abs/1611.02506

The probabilistic minimum dominating set problem

Autor: Boria, Nicolas, Murat, Cécile, Paschos, Vangelis Th.

Publikováno v: In Discrete Applied Mathematics 10 January 2018 234:93-113

Reoptimization in machine scheduling

Autor: Boria, Nicolas, Della Croce, Federico

Publikováno v: In Theoretical Computer Science 26 June 2014 540-541:13-26