Z. Abu-aisheh, B. Gaüzere, S. Bougleux, J. Y. Ramel, L. Brun et al., Graph edit distance contest: Results and future challenges, Pattern Recognition Letters, vol.100, pp.96-103, 2017.
DOI : 10.1016/j.patrec.2017.10.007

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

D. B. Blumenthal and J. Gamper, Improved Lower Bounds for Graph Edit Distance, IEEE Transactions on Knowledge and Data Engineering, vol.30, issue.3, pp.503-516, 2018.
DOI : 10.1109/TKDE.2017.2772243

D. B. Blumenthal and J. Gamper, On the exact computation of the graph edit distance, Pattern Recognition Letters, 2018.
DOI : 10.1016/j.patrec.2018.05.002

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, D. B. Blumenthal, and L. Brun, Fast linear sum assignment with error-correction and no cost constraints, Pattern Recognition Letters, 2018.
DOI : 10.1016/j.patrec.2018.03.032

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

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 2015, pp.188-197, 0719.
DOI : 10.1007/978-3-319-18224-7_19

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

M. Ferrer, F. Serratosa, and K. Riesen, A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching, GbRPR 2015, pp.77-86, 2015.
DOI : 10.1007/978-3-319-18224-7_8

B. Gauzère, S. Bougleux, K. Riesen, and L. Brun, Approximate graph edit distance guided by bipartite matching of bags of walks, S+SSPR 2014, pp.73-82, 2014.

L. Digabel and S. , Algorithm 909, ACM Transactions on Mathematical Software, vol.37, issue.4, pp.1-44, 2011.
DOI : 10.1145/1916461.1916468

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 and H. Bunke, Improving bipartite graph edit distance approximation using various search strategies. Pattern Recogn, pp.1349-1363, 2015.

K. Riesen, H. Bunke, and A. Fischer, Improving Graph Edit Distance Approximation by Centrality Measures, 2014 22nd International Conference on Pattern Recognition, pp.3910-3914, 2014.
DOI : 10.1109/ICPR.2014.670

K. Riesen, M. Ferrer, A. Fischer, and H. Bunke, Approximation of Graph Edit Distance in Quadratic Time, GbRPR 2015, pp.3-12, 2015.
DOI : 10.1007/978-3-319-18224-7_1

K. Riesen, A. Fischer, and H. Bunke, Improved Graph Edit Distance Approximation with Simulated Annealing, GbRPR 2017, pp.222-231, 2017.
DOI : 10.1007/978-3-540-89689-0_33

L. M. Rios and N. V. Sahinidis, Derivative-free optimization: a review of algorithms and comparison of software implementations, Journal of Global Optimization, vol.18, issue.3, pp.1247-1293, 2013.
DOI : 10.1088/0953-8984/18/39/002

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

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

W. Zheng, L. Zou, X. Lian, D. Wang, and D. Zhao, Efficient Graph Similarity Search Over Large Graph Databases, IEEE Transactions on Knowledge and Data Engineering, vol.27, issue.4, pp.964-978, 2015.
DOI : 10.1109/TKDE.2014.2349924