Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal-normandie-univ.archives-ouvertes.fr/hal-02162839
Contributor : Luc Brun <>
Submitted on : Saturday, June 22, 2019 - 9:40:23 PM
Last modification on : Thursday, March 5, 2020 - 3:31:56 PM

File

gbr19-gedlib.pdf
Files produced by the author(s)

Identifiers

  • 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⟩

Share

Metrics

Record views

77

Files downloads

577