Graph edit distance contest 2016: Results and future challenges, Pattern Recogn. Lett, vol.100, pp.96-103, 2017. ,
Improved lower bounds for graph edit distance, IEEE Trans. Knowl. Data Eng, vol.30, issue.3, pp.503-516, 2018. ,
Correcting and speeding-up bounds for non-uniform graph edit distance, ICDE, pp.131-134, 2017. ,
A hungarian algorithm for errorcorrecting graph matching, GbRPR, volume 10310 of LNCS, pp.118-127, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01540920
Graph edit distance as a quadratic assignment problem, Pattern Recogn. Lett, vol.87, pp.38-46, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01613964
An extension of the Munkres algorithm for the assignment problem to rectangular matrices, Commun. ACM, vol.14, pp.802-804, 1971. ,
Inexact graph matching for structural pattern recognition, Pattern Recogn. Lett, vol.1, issue.4, pp.245-253, 1983. ,
, , 2009.
Approximate graph edit distance computation combining bipartite matching and exact neighborhood substructure distance, GbRPR, vol.9069, pp.188-197, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01389626
Approximate graph edit distance by several local searches in parallel, ICPRAM, pp.149-158, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01664529
A first step towards exact graph edit distance using bipartite graph matching, GbRPR, pp.77-86, 2015. ,
Approximate graph edit distance guided by bipartite matching of bags of walks, S+SSPR, vol.8621, pp.73-82, 2014. ,
Revisiting Volgenant-Jonker for approximating graph edit distance, GbRPR, vol.9069, pp.98-107, 2015. ,
Optimising the Volgenant-Jonker algorithm for approximating graph edit distance, Pattern Recogn. Lett, vol.87, pp.47-54, 2017. ,
Variants of the hungarian method for the assignment problem, Nav. Res. Logist. Q, vol.3, pp.253-258, 1956. ,
Combinatorial Optimization: Networks and, 1976. ,
Exact graph edit distance computation using a binary linear program, S+SSPR, volume 10029 of LNCS, pp.485-495, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01491027
A 'hard' assignment problem, Oper. Res, vol.24, pp.190-192, 1976. ,
Algorithms for the assignment and transportation problems, SIAM J. Appl. Math, vol.5, issue.1, pp.32-38, 1957. ,
Structural Pattern Recognition with Graph Edit Distance. Advances in Computer Vision and Pattern Recognition, 2015. ,
Approximate graph edit distance computation by means of bipartite graph matching, Image Vis. Comput, vol.27, issue.7, pp.950-959, 2009. ,
Improving bipartite graph edit distance approximation using various search strategies, Pattern Recogn, vol.28, issue.4, pp.1349-1363, 2015. ,
Bipartite graph matching for computing the edit distance of graphs, GbRPR, vol.4538, pp.1-12, 2007. ,
Approximation of graph edit distance in quadratic time, GbRPR, vol.9069, pp.3-12, 2015. ,
Improved graph edit distance approximation with simulated annealing, GbRPR, volume 10310 of LNCS, pp.222-231, 2017. ,
A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. Syst. Man Cybern, vol.13, issue.3, pp.353-362, 1983. ,
Fast computation of bipartite graph matching, Pattern Recogn. Lett, vol.45, pp.244-250, 2014. ,
Computation of graph edit distance: Reasoning about optimality and speed-up, Image Vis. Comput, vol.40, pp.38-48, 2015. ,
Speeding up fast bipartite graph matching through a new cost matrix, Int. J. Pattern Recogn, vol.29, issue.2, 2015. ,
Accurate and fast computation of approximate graph edit distance based on graph relabeling, ICPRAM, pp.17-26, 2018. ,
Comparing stars: On approximating graph edit distance, vol.2, pp.25-36, 2009. ,
Efficient graph similarity search over large graph databases, IEEE Trans. Knowl. Data Eng, vol.27, issue.4, pp.964-978, 2015. ,