18 citations · 52 across the 12 of their papers we have counts for
4 papers · 1 filter
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…
Upper Bounding the Graph Edit Distance Based on Rings and Machine Learning
David B. Blumenthal, Johann Gamper, Sébastien Bougleux +1
The graph edit distance (GED) is a flexible distance measure which is widely used for inexact graph matching. Since its exact computation is NP-hard, heuristics are used in practic…
Linear Sum Assignment with Edition
Sébastien Bougleux, Luc Brun
We consider the problem of transforming a set of elements into another by a sequence of elementary edit operations, namely substitutions, removals and insertions of elements. Each…
A Quadratic Assignment Formulation of the Graph Edit Distance
Sébastien Bougleux, Luc Brun, Vincenzo Carletti +3
Computing efficiently a robust measure of similarity or dissimilarity between graphs is a major challenge in Pattern Recognition. The Graph Edit Distance (GED) is a flexible measur…