S. Bougleux, L. Brun, V. Carletti, P. Foggia, B. Gaüzère et al., A quadratic assignment formulation of the graph edit distance, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01246709

H. Bunke and G. Allermann, Inexact graph matching for structural pattern recognition, Pattern Recognition Letters, vol.1, issue.4, pp.245-253, 1983.
DOI : 10.1016/0167-8655(83)90033-8

V. Carletti, B. Gaüzère, L. Brun, and M. Vento, Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance, GbRPR, pp.168-177, 2015.
DOI : 10.1007/978-3-319-18224-7_19
URL : https://hal.archives-ouvertes.fr/hal-01389626

B. Gaüzère, S. Bougleux, K. Riesen, and L. Brun, Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks, Structural, Syntactic and Statistical Pattern Recognition, pp.73-82, 2014.

D. Justice and A. Hero, A binary linear programming formulation of the graph edit distance, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.8, pp.1200-1214, 2006.
DOI : 10.1109/TPAMI.2006.152

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109

M. Leordeanu, M. Hebert, and R. Sukthankar, An integer projected fixed point method for graph matching and map inference, Advances in neural information processing systems, pp.1114-1122, 2009.

C. Lin, Hardness of approximating graph transformation problem, 5th Annual International Symposium on Algorithms and Computation, pp.74-82, 1994.
DOI : 10.1007/3-540-58325-4_168

Z. Liu and H. Qiao, GNCCP—Graduated NonConvexityand Concavity Procedure, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.36, issue.6, pp.1258-1267, 2014.
DOI : 10.1109/TPAMI.2013.223

M. Neuhaus and H. Bunke, A Quadratic Programming Approach to the Graph Edit Distance Problem, GbRPR, pp.92-102, 2007.
DOI : 10.1007/978-3-540-72903-7_9

K. Riesen and H. Bunke, Approximate graph edit distance computation by means of bipartite graph matching, Image and Vision Computing, vol.27, issue.7, pp.950-959, 2009.
DOI : 10.1016/j.imavis.2008.04.004

K. Riesen, S. Emmenegger, and H. Bunke, A Novel Software Toolkit for Graph Edit Distance Computation, Graph-based Representations in Pattern Recognition, pp.142-151, 2013.
DOI : 10.1007/978-3-642-38221-5_15

L. Brun, S. Bougleux, and B. Gaüzère, Graph edit distance as a quadratic program, ICPR 2016, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01418937

A. Sanfeliu and K. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Transactions on Systems, Man, and Cybernetics, vol.13, issue.3, pp.353-362, 1983.
DOI : 10.1109/TSMC.1983.6313167

S. Serratosa, Speeding up Fast Bipartite Graph Matching Through a New Cost Matrix, International Journal of Pattern Recognition and Artificial Intelligence, vol.29, issue.02, p.2015
DOI : 10.1142/S021800141550010X

M. Zaslavskiy, F. Bach, and J. Vert, A Path Following Algorithm for the Graph Matching Problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.12, pp.312227-2242, 2009.
DOI : 10.1109/TPAMI.2008.245
URL : https://hal.archives-ouvertes.fr/hal-00232851

F. Zhou and F. De-la-torre, Factorized Graph Matching, CVPR, pp.127-134, 2012.
DOI : 10.1109/TPAMI.2015.2501802