GEDLIB: A C++ Library for Graph Edit Distance Computation

This paper presents a new Mixed Integer Linear Program (MILP) formulation for the Graph Edit Distance (GED) problem.. The contribution is an exact method that solves the GED problem

Abstract: Graph edit distance is an error tolerant matching technique emerged as a powerful and flexible graph matching paradigm that can be used to address different tasks in

Serratosa, A general model to define the substitu- tion, insertion and deletion graph edit costs based on an embedded space, Pattern Recognition Let- ters 138 (2020) 115 –

walks is that rings can model general edit costs, avoid redundancies due to multiple node or edges inclusions, and allow to define a fine-grained distance measure between the

Five values of N were chosen: -1, 100, 250, 500 and 1000, where N =-1 represents the decomposition of the first floor in the search tree with all possible branches, N = 100 and

The aim of this paper is to bring the potentialities of Machine Learning to the Graph Edit Distance problem presenting a general framework in which this kind of algorithms are used

Five values of N were chosen: -1, 100, 250, 500 and 1000, where N =-1 represents the de- composition of the first floor in the search tree with all possible branches, N = 100 and

After running all algorithms, we computed a joint score s LB (ALG) ∈ [0, 1] for all algorithms that yield lower bounds and a joint score s UB (ALG) ∈ [0, 1] for all algorithms