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

Abstract : The graph edit distance (GED) is a flexible graph dissimilarity measure widely used within the structural pattern recognition field. In this paper, we present GEDLIB, a C++ library for exactly or approximately computing GED. Many existing algorithms for GED are already implemented in GEDLIB. Moreover, GEDLIB is designed to be easily extensible: for implementing new edit cost functions and GED algorithms, it suffices to implement abstract classes contained in the library. For implementing these extensions, the user has access to a wide range of utilities, such as deep neural networks, support vector machines, mixed integer linear programming solvers, a blackbox optimizer, and solvers for the linear sum assignment problem with and without error-correction.
Liste complète des métadonnées

Littérature citée [37 références]  Voir  Masquer  Télécharger

https://hal-normandie-univ.archives-ouvertes.fr/hal-02162839
Contributeur : Luc Brun <>
Soumis le : samedi 22 juin 2019 - 21:40:23
Dernière modification le : vendredi 5 juillet 2019 - 01:38:00

Fichier

gbr19-gedlib.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-02162839, version 1

Citation

David Blumenthal, Sébastien Bougleux, Luc Brun, Johann Gamper. GEDLIB: A C++ Library for Graph Edit Distance Computation. 12th IAPR TC15 Workshop on Graph-Based Representation in Pattern Recognition (GbR), 2019, Jun 2019, Tours, France. ⟨hal-02162839⟩

Partager

Métriques

Consultations de la notice

28

Téléchargements de fichiers

107