Z. Abu-aisheh, R. Raveaux, and J. Y. Ramel, A graph database repository and performance evaluation metrics for graph edit distance, Graph-Based Representations in Pattern Recognition, vol.9069, pp.138-147, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01168809

Z. Abu-aisheh, B. Gaüzère, 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.
URL : https://hal.archives-ouvertes.fr/hal-01624592

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

V. Carletti, B. Gaüzère, L. Brun, and M. Vento, Approximate graph edit distance computation combining bipartite matching and exact neighborhood substructure distance, Graph-Based Representations in Pattern Recognition, vol.9069, pp.168-177, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01389626

E. Daller, S. Bougleux, B. Gaüzère, and L. Brun, Approximate graph edit distance from several assignments and multiple IPFP, Int. Conf. on Pattern Recognition Applications and Methods, 2018.

M. Ferrer, F. Serratosa, and K. Riesen, A first step towards exact graph edit distance using bipartite graph matching, Graph-based Representations in Pattern Recognition, vol.9069, pp.77-86, 2015.

M. Frank and P. Wolfe, An algorithm for quadratic programming, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.95-110, 1956.

B. Gaüzère, S. Bougleux, and L. Brun, Approximating graph edit distance using GNCCP, Structural, Syntactic, and Statistical Pattern Recognition, vol.10029, pp.496-506, 2016.

K. Riesen and H. Bunke, Approximate graph edit distance computation by means of bipartite graph matching, Image and Vision Computing, vol.27, pp.950-959, 2009.

K. Riesen and H. Bunke, Improving bipartite graph edit distance approximation using various search strategies, Pattern Recogn, vol.48, issue.4, pp.1349-1363, 2015.

K. Riesen, A. Fischer, and H. Bunke, Improved graph edit distance approximation with simulated annealing, Graph-based Representations in Pattern Recognition, vol.10310, pp.222-231, 2017.

A. Sanfeliu and K. S. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Transactions on Systems, Man. and Cybernetics, vol.13, issue.3, pp.353-362, 1983.

Z. Wu, B. Ramsundar, E. N. Feinberg, J. Gomes, C. Geniesse et al., Moleculenet: a benchmark for molecular machine learning, Chem. Sci, vol.9, pp.513-530, 2018.

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.