Ring Based Approximation of Graph Edit Distance

Abstract : The graph edit distance (GED) is a flexible graph dissimilar-ity measure widely used within the structural pattern recognition field. A widely used paradigm for approximating GED is to define local structures rooted at the nodes of the input graphs and use these structures to transform the problem of computing GED into a linear sum assignment problem with error correction (LSAPE). In the literature, different local structures such as incident edges, walks of fixed length, and induced subgraphs of fixed radius have been proposed. In this paper, we propose to use rings as local structure, which are defined as collections of nodes and edges at fixed distances from the root node. We empirically show that this allows us to quickly compute a tight approximation of GED.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

Contributeur : Luc Brun <>
Soumis le : vendredi 31 août 2018 - 09:58:55
Dernière modification le : jeudi 7 février 2019 - 17:35:27
Document(s) archivé(s) le : samedi 1 décembre 2018 - 14:35:18


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01865194, version 1


David Blumenthal, Sébastien Bougleux, Johann Gamper, Luc Brun. Ring Based Approximation of Graph Edit Distance. Structural, Syntactic, and Statistical Pattern Recognition - Joint IAPR International Workshop, S+SSPR 2018, Aug 2018, Pékin, China. 〈hal-01865194〉



Consultations de la notice


Téléchargements de fichiers