A Hungarian Algorithm for Error-Correcting Graph Matching

Abstract : Bipartite graph matching algorithms become more and more popular to solve error-correcting graph matching problems and to approximate the graph edit distance of two graphs. However, the memory requirements and execution times of this method are respectively proportional to (n + m) 2 and (n + m) 3 where n and m are the order of the graphs. Subsequent developments reduced these complexities. However , these improvements are valid only under some constraints on the parameters of the graph edit distance. We propose in this paper a new formulation of the bipartite graph matching algorithm designed to solve efficiently the associated graph edit distance problem. The resulting algorithm requires O(nm) memory space and O(min(n, m) 2 max(n, m)) execution times.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download

Contributor : Luc Brun <>
Submitted on : Friday, June 16, 2017 - 5:05:51 PM
Last modification on : Thursday, February 7, 2019 - 3:26:17 PM
Document(s) archivé(s) le : Wednesday, January 10, 2018 - 12:44:45 PM


Files produced by the author(s)



Sébastien Bougleux, Benoit Gaüzère, Luc Brun. A Hungarian Algorithm for Error-Correcting Graph Matching. 11th IAPR-TC-15 International Workshop on Graph-Based Representation in Pattern Recognition (GbRPR 2017), Pasquale Foggia, May 2017, AnaCapri, Italy. pp.118-127, ⟨10.1007/978-3-319-58961-9_11⟩. ⟨hal-01540920⟩



Record views


Files downloads