Graph Edit Distance in the exact context - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Graph Edit Distance in the exact context

Résumé

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 for attributed graphs. It has an advantage over the best existing one when dealing with the case of dense of graphs, because all its constraints are independent from the number of edges in the graphs. The experiments have shown the efficiency of the new formulation in the exact context.
Fichier principal
Vignette du fichier
2018SSPRGED.pdf (289.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01880093 , version 1 (24-09-2018)

Identifiants

  • HAL Id : hal-01880093 , version 1

Citer

Mostafa Darwiche, Romain Raveaux, Donatello Conte, Vincent t'Kindt. Graph Edit Distance in the exact context. Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR), Aug 2018, Bejing, China. pp. 326-336. ⟨hal-01880093⟩
68 Consultations
167 Téléchargements

Partager

Gmail Facebook X LinkedIn More