Z. Abu-aisheh, R. Raveaux, and J. Ramel, A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance, pp.138-147, 2015.
DOI : 10.1007/978-3-319-18224-7_14

URL : https://hal.archives-ouvertes.fr/hal-01168809

Z. Abu-aisheh, R. Raveaux, J. Ramel, and P. Martineau, An Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems, Proceedings of the International Conference on Pattern Recognition Applications and Methods, pp.271-278, 2015.
DOI : 10.5220/0005209202710278

URL : https://hal.archives-ouvertes.fr/hal-01168816

Z. Abu-aisheh, R. Raveaux, J. Ramel, and P. Martineau, A Parallel Graph Edit Distance Algorithm, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01476393

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

URL : https://hal.archives-ouvertes.fr/hal-01613964

S. Bougleux, B. Gaüzère, and L. Brun, A hungarian algorithm for errorcorrecting graph matching, in: IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, LNCS, vol.10310, pp.118-127, 2017.

S. Bougleux, B. Gazre, and L. Brun, Graph edit distance as a quadratic program, 2016 23rd International Conference on Pattern Recognition (ICPR), pp.1701-1706, 2016.
DOI : 10.1109/ICPR.2016.7899881

URL : https://hal.archives-ouvertes.fr/hal-01418937

V. Carletti, B. Gaüzère, L. Brun, and M. Vento, Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance, LNCS, vol.9069, pp.168-177, 2015.
DOI : 10.1007/978-3-319-18224-7_19

URL : https://hal.archives-ouvertes.fr/hal-01389626

X. Cortés and F. Serratosa, Active-Learning Query Strategies Applied to Select a Graph Node Given a Graph Labelling, LNCS, vol.7877, pp.61-70, 2013.
DOI : 10.1007/978-3-642-38221-5_7

X. Cortés and F. Serratosa, Learning Graph Matching Substitution Weights Based on the Ground Truth Node Correspondence, International Journal of Pattern Recognition and Artificial Intelligence, vol.11, issue.5, 2016.
DOI : 10.1142/S0218001413500018

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.

F. Glover and M. Laguna, General purpose heuristics for integer programming?Part I, Journal of Heuristics, vol.19, issue.5, pp.343-35810, 1007.
DOI : 10.1007/BF00132504

I. Tc, GREYC datasets URL: https, 2013.

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.2140/pjm.1953.3.369

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.

J. Lerouge, Z. Abu-aisheh, R. Raveaux, P. Héroux, and S. Adam, Exact Graph Edit Distance Computation Using a Binary Linear Program, Structural , Syntactic, and Statistical Pattern Recognition, pp.485-495, 2016.
DOI : 10.14778/1687627.1687631

URL : https://hal.archives-ouvertes.fr/hal-01491027

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

URL : https://hal.archives-ouvertes.fr/hal-01619308

Z. Y. 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

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

M. Neuhaus, K. Riesen, and H. Bunke, Fast Suboptimal Algorithms for the Computation of Graph Edit Distance, Structural, Syntactic, and Statistical Pattern Recognition, pp.163-172, 2006.
DOI : 10.1007/11815921_17

K. Riesen, Structural Pattern Recognition with Graph Edit Distance - Approximation Algorithms and Applications Advances in Computer Vision and Pattern Recognition, 2015.

K. Riesen and H. Bunke, IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning, Structural, Syntactic, and Statistical Pattern Recognition, pp.287-297, 2008.
DOI : 10.1093/nar/28.1.235

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. Fankhauser, and H. Bunke, Speeding up graph edit distance computation with a bipartite heuristic, Mining and Learning with Graphs, 2007.

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

F. Serratosa and X. Cortés, Graph Edit Distance: Moving from global to local structure to solve the graph-matching problem, Pattern Recognition Letters, vol.65, pp.204-210, 2015.
DOI : 10.1016/j.patrec.2015.08.003

C. C. Wang, CMU dataset, 2003.