S. Bougleux and L. Brun, Linear sum assignment with edition, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01288288

S. Bougleux, L. Brun, V. Carletti, P. Foggia, B. Gaüzère et al., Graph edit distance as a quadratic assignment problem, Pattern Recognition Letters, vol.87, pp.38-46, 2017.
DOI : 10.1016/j.patrec.2016.10.001

S. Bougleux, B. Gaüzère, and L. Brun, Graph edit distance as a quadratic program, 2016 23rd International Conference on Pattern Recognition (ICPR), 2016.
DOI : 10.1109/ICPR.2016.7899881
URL : https://hal.archives-ouvertes.fr/hal-01418937

F. Bourgeois and J. Lassalle, An extension of the Munkres algorithm for the assignment problem to rectangular matrices, Communications of the ACM, vol.14, issue.12, pp.802-804, 1971.
DOI : 10.1145/362919.362945

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.

W. Jones, A. Chawdhary, and A. King, Revisiting Volgenant-Jonker for Approximating Graph Edit Distance, Graph-Based Representations in Pattern Recognition, pp.98-107, 2015.
DOI : 10.1007/978-3-319-18224-7_10

R. Jonker and A. Volgenant, Improving the Hungarian assignment algorithm, Operations Research Letters, vol.5, issue.4, pp.171-175, 1986.
DOI : 10.1016/0167-6377(86)90073-8

E. Lawler, Combinatorial Optimization: Networks and Matroids, 1976.

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.

M. Neuhaus and H. Bunke, A Quadratic Programming Approach to the Graph Edit Distance Problem, Graph-Based Representations in Pattern Recognition, 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

F. Serratosa, Fast computation of Bipartite graph matching, Pattern Recognition Letters, vol.45, pp.244-250, 2014.
DOI : 10.1016/j.patrec.2014.04.015

F. Serratosa, Speeding up Fast Bipartite Graph Matching Through a New Cost Matrix, International Journal of Pattern Recognition and Artificial Intelligence, vol.29, issue.02, 2015.
DOI : 10.1016/S0167-8655(97)00117-7