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.
URL : https://hal.archives-ouvertes.fr/hal-01613964

H. Bunke, On a relation between graph edit distance and maximum common subgraph, Pattern Recognition Letters, vol.18, issue.8, pp.689-694, 1997.

H. Bunke, Error correcting graph matching: On the influence of the underlying cost function, vol.21, pp.917-922, 1999.

H. Bunke and G. Allermann, Inexact graph matching for structural pattern recognition, Pattern Recognition Letters, vol.1, issue.4, pp.245-253, 1983.

T. H. Cormen, Section 24.3: Dijkstra's algorithm. Introduction to algorithms pp, pp.595-601, 2001.

M. Darwiche, D. Conte, R. Raveaux, and V. Tkindt, Graph edit distance: Accuracy of local branching from an application point of view, Pattern Recognition Letters, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01761595

M. Darwiche, D. Conte, R. Raveaux, and V. Tkindt, A local branching heuristic for solving a graph edit distance problem, Computers & Operations Research, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01587928

M. Darwiche, R. Raveaux, D. Conte, and V. Tkindt, Graph edit distance in the exact context, Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR), pp.304-314, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01880093

F. Della-croce, A. Grosso, and F. Salassa, Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems, The Oxford Handbook of Innovation, 2013.

M. Ferrer, F. Serratosa, and K. Riesen, Improving bipartite graph matching by assessing the assignment confidence, Pattern Recognition Letters, vol.65, pp.29-36, 2015.

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.

J. Lerouge, Z. Abu-aisheh, R. Raveaux, P. Héroux, and S. Adam, New binary linear programming formulation to compute the graph edit distance, Pattern Recognition, vol.72, pp.254-265, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01619308

C. F. Moreno-garcía, X. Cortés, and F. Serratosa, A graph repository for learning error-tolerant graph matching, Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR), pp.519-529, 2016.

J. Munkres, Algorithms for the assignment and transportation problems, Journal of the society for industrial and applied mathematics, vol.5, issue.1, pp.32-38, 1957.

K. Riesen, Structural pattern recognition with graph edit distance. Advances in Computer Vision and Pattern Recognition, 2015.

K. Riesen, M. Neuhaus, and H. Bunke, Bipartite graph matching for computing the edit distance of graphs, International Workshop on Graph-Based Representations in Pattern Recognition, pp.1-12, 2007.

F. Serratosa, Computation of graph edit distance: reasoning about optimality and speed-up, Image and Vision Computing, vol.40, pp.38-48, 2015.

M. Stauffer, T. Tschachtli, A. Fischer, and K. Riesen, A survey on applications of bipartite graph edit distance, International Workshop on Graph-Based Representations in Pattern Recognition, pp.242-252, 2017.

Z. Zeng, A. K. Tung, J. Wang, J. Feng, and L. Zhou, Comparing stars: On approximating graph edit distance, Proceedings of the VLDB Endowment, vol.2, pp.25-36, 2009.