Z. Abu-aisheh, R. Raveaux, and J. Y. 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. Y. 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

H. A. Almohamad and S. O. Duffuaa, A linear programming approach for the weighted graph matching problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.15, issue.5, pp.522-525, 1993.
DOI : 10.1109/34.211474

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

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, Third Edition, 2009.

P. Erd?-os and A. Rényi, On random graphs, I. Publ. Math. Debrecen, vol.6, pp.290-297, 1959.

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

B. Gauzere, L. Brun, and D. Villemin, Two new graphs kernels in chemoinformatics, Pattern Recognition Letters, vol.33, issue.15, pp.2038-2047, 2012.
DOI : 10.1016/j.patrec.2012.03.020

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

E. A. Hansen and R. Zhou, Anytime heuristic search, J. Artif. Int. Res, vol.28, pp.267-297, 2007.

J. E. Hopcroft and J. K. Wong, Linear time algorithm for isomorphism of planar graphs (Preliminary Report), Proceedings of the sixth annual ACM symposium on Theory of computing , STOC '74, pp.172-184, 1974.
DOI : 10.1145/800119.803896

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

A. L. Köll and H. Kaindl, A new approach to dynamic weighting, Proceedings of the 10th European Conference on Artificial Intelligence, pp.16-17, 1992.

R. E. Korf, Linear-space best-first search, Artificial Intelligence, vol.62, issue.1, pp.41-78, 1993.
DOI : 10.1016/0004-3702(93)90045-D

M. Leordeanu, M. Hebert, and R. Sukthankar, An integer projected fixed point method for graph matching and map inference, Proceedings Neural Information Processing Systems, pp.1114-1122, 2009.

M. Likhachev, D. Ferguson, G. Gordon, A. Stentz, and S. Thrun, Anytime search in dynamic graphs, Artificial Intelligence, vol.172, issue.14, pp.1613-1643, 2008.
DOI : 10.1016/j.artint.2007.11.009

URL : https://doi.org/10.1016/j.artint.2007.11.009

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

URL : http://www.eecs.umich.edu/%7Epettie/matching/Munkres-variant-of-Hungarian-alg.pdf

M. Neuhaus, K. Riesen, and H. Bunke, Fast Suboptimal Algorithms for the Computation of Graph Edit Distance, SSPR, vol.28, pp.163-172, 2006.
DOI : 10.1007/11815921_17

K. Riesen and B. H. , Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing, pp.950-959, 2009.
DOI : 10.1016/j.imavis.2008.04.004

K. Riesen, Structural Pattern Recognition with Graph Edit Distance - Approximation Algorithms and Applications. Advances in Computer Vision and Pattern Recognition, 2015.
DOI : 10.1007/978-3-319-27252-8

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

K. Riesen and H. Bunke, Improving Approximate Graph Edit Distance by Means of a Greedy Swap Strategy 8509, pp.314-321, 2014.

K. Riesen, S. Fankhauser, and H. Bunke, Speeding up graph edit distance computation with a bipartite heuristic, in: Mining and Learning with Graphs, 2007.

K. Riesen, A. Fischer, and H. Bunke, Improving Approximate Graph Edit Distance Using Genetic Algorithms, pp.63-72, 2014.
DOI : 10.1007/978-3-662-44415-3_7

DOI : 10.1142/9789814343008_0003

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. Shimbo and T. Ishida, Controlling the learning process of real-time heuristic search, Artificial Intelligence, vol.146, issue.1, pp.1-41, 2003.
DOI : 10.1016/S0004-3702(03)00012-2

A. Torsello, D. Hidovic-rowe, and M. Pelillo, Polynomial-time metrics for attributed trees, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.27, issue.7, pp.1087-1099, 2005.
DOI : 10.1109/TPAMI.2005.146

URL : http://www.dsi.unive.it/~atorsell/cs-2003-19.pdf

S. Umeyama, An eigen decomposition approach to weighted graph matching problems. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.10, pp.695-703, 1988.
DOI : 10.1109/34.6778

M. Vento, A long trip in the charming world of graphs for Pattern Recognition, Pattern Recognition, vol.48, issue.2, pp.291-301, 2015.
DOI : 10.1016/j.patcog.2014.01.002

M. Zaslavskiy, F. Bach, and J. Ver, A Path Following Algorithm for the Graph Matching Problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.12, pp.2227-2242, 2009.
DOI : 10.1109/TPAMI.2008.245

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

W. Zhang, Complete anytime beam search, Proceedings of the Fifteenth National/Tenth Conference on Artificial Intelligence/Innovative Applications of Artificial Intelligence, pp.425-430, 1998.

F. Zhou and F. D. La-torre, Factorized Graph Matching, 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp.127-134, 2012.
DOI : 10.1109/TPAMI.2015.2501802

S. Zilberstein, Using anytime algorithms in intelligent systems, AI Magazine, vol.17, pp.73-83, 1996.

S. Zilberstein and S. J. Russell, Approximate Reasoning Using Anytime Algorithms, Imprecise and Approximate Computation, 1995.
DOI : 10.1007/978-0-585-26870-5_4

URL : http://anytime.cs.umass.edu/shlomo/papers/kluwer95.pdf