On the unification of the graph edit distance and graph matching problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Pattern Recognition Letters Année : 2021

On the unification of the graph edit distance and graph matching problems

Résumé

Error-tolerant graph matching gathers an important family of problems. These problems aim at finding correspondences between two graphs while integrating an error model. In the Graph Edit Distance (GED) problem, the insertion/deletion of edges/nodes from one graph to another is explicitly expressed by the error model. At the opposite, the problem commonly referred to as "graph matching" does not explicitly express such operations. For decades, these two problems have split the research community in two separated parts. It resulted in the design of different solvers for the two problems. In this paper, we propose a unification of both problems thanks to a single model. We give the proof that the two problems are equivalent under a reformulation of the error models. This unification makes possible the use on both problems of existing solving methods from the two communities.
Fichier principal
Vignette du fichier
elsarticle-template-1-num.pdf (501.89 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03163084 , version 1 (09-03-2021)
hal-03163084 , version 2 (19-03-2021)

Identifiants

Citer

Romain Raveaux. On the unification of the graph edit distance and graph matching problems. Pattern Recognition Letters, 2021, 145, ⟨10.1016/j.patrec.2021.02.014⟩. ⟨hal-03163084v2⟩
130 Consultations
120 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More