GEDLIB: A C++ Library for Graph Edit Distance Computation
Blumenthal DB, Bougleux S, Gamper J, Brun L (2019)
Publication Type: Conference contribution
Publication year: 2019
Journal
Publisher: Springer Verlag
Series: Lecture Notes in Computer Science
Book Volume: 11510
Pages Range: 14-24
Conference Proceedings Title: 12th IAPR-TC-15 International Workshop, GbRPR 2019, Tours, France, June 19–21, 2019, Proceedings
Event location: Tours
ISBN: 9783030200800
DOI: 10.1007/978-3-030-20081-7_2
Abstract
The graph edit distance ($$\mathrm {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 $$\mathrm {GED}$$. Many existing algorithms for $$\mathrm {GED}$$ are already implemented in GEDLIB. Moreover, GEDLIB is designed to be easily extensible: for implementing new edit cost functions and $$\mathrm {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.
Authors with CRIS profile
Involved external institutions
Italy (IT)How to cite
APA:
Blumenthal, D.B., Bougleux, S., Gamper, J., & Brun, L. (2019). GEDLIB: A C++ Library for Graph Edit Distance Computation. In Donatello Conte, Jean-Yves Ramel, Pasquale Foggia (Eds.), 12th IAPR-TC-15 International Workshop, GbRPR 2019, Tours, France, June 19–21, 2019, Proceedings (pp. 14-24). Tours, FR: Springer Verlag.
MLA:
Blumenthal, David B., et al. "GEDLIB: A C++ Library for Graph Edit Distance Computation." Proceedings of the 12th IAPR-TC15 Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2019, Tours Ed. Donatello Conte, Jean-Yves Ramel, Pasquale Foggia, Springer Verlag, 2019. 14-24.
BibTeX: Download