J. W. Raymond and P. Willett, Maximum common subgraph isomorphism algorithms for the matching of chemical structures, Journal of Computer-Aided Molecular Design, vol.16, issue.7, pp.521-533, 2002.
DOI : 10.1023/A:1021271615909

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.
DOI : 10.1109/34.531800

D. Conte, P. Foggia, C. Sansone, and M. Vento, THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION, International Journal of Pattern Recognition and Artificial Intelligence, vol.31, issue.03, pp.265-298, 2004.
DOI : 10.1109/3477.956043
URL : https://hal.archives-ouvertes.fr/hal-01408706

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

H. Bunke, On a relation between graph edit distance and maximum common subgraph, Pattern Recognition Letters, vol.18, issue.8, pp.689-694, 1997.
DOI : 10.1016/S0167-8655(97)00060-3

H. Bunke, Error correcting graph matching: on the influence of the underlying cost function, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.21, issue.9, pp.917-922, 1999.
DOI : 10.1109/34.790431

Z. Zeng, A. K. Tung, J. Wang, J. Feng, and L. Zhou, Comparing stars, Proceedings of the VLDB Endowment, pp.25-36, 2009.
DOI : 10.14778/1687627.1687631

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
DOI : 10.1016/j.patcog.2017.07.029

D. Justice and A. , 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

S. Bougleux, L. Brun, V. Carletti, P. Foggia, B. Gaüzère et al., A quadratic assignment formulation of the graph edit distance, arXiv preprint

K. Riesen, M. Neuhaus, and H. Bunke, Bipartite Graph Matching for Computing the Edit Distance of Graphs, pp.1-12, 2007.
DOI : 10.1007/978-3-540-72903-7_1

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, Computation of graph edit distance: Reasoning about optimality and speed-up, Image and Vision Computing, vol.40, pp.38-48, 2015.
DOI : 10.1016/j.imavis.2015.06.005

M. Neuhaus, K. Riesen, and H. Bunke, Fast Suboptimal Algorithms for the Computation of Graph Edit Distance, Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR), pp.163-172, 2006.
DOI : 10.1007/11815921_17

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.
DOI : 10.1016/j.patrec.2015.07.010

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

M. Fischetti and A. Lodi, Local branching, Mathematical Programming, vol.98, issue.1-3, pp.23-47, 2003.
DOI : 10.1007/s10107-003-0395-5

A. Robles-kelly, M. Loog, B. Biggio, F. Escolano, and R. C. Wilson, Structural, Syntactic, and Statistical Pattern Recognition -Joint IAPR International Workshop, Proceedings, pp.978-981, 2016.

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

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.
DOI : 10.1137/0105003
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.3911

Z. Abu-aisheh, R. Raveaux, and J. , A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance, Proceedings, pp.138-147, 2015.
DOI : 10.1007/978-3-319-18224-7_14
URL : https://hal.archives-ouvertes.fr/hal-01168809