M. Alexander, M. Bronstein, and B. A. , Partial similarity of objects, or how to compare a centaur to a horse, International Journal of Computer Vision, vol.84, pp.163-183, 2009.

H. Bunke and A. G. , Inexact graph matching for structural pattern recognition, Pattern Recognition Letters, vol.4, pp.245-253, 1983.

T. S. Caetano, J. J. Mcauley, L. Cheng, Q. V. Le, and A. J. Smola, Learning graph matching, vol.31, pp.1048-1058, 2009.

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.18, pp.265-298, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01408706

C. Cortes, Support-vector networks, Machine Learning, vol.20, pp.273-297, 1995.

X. Cortés, D. Conte, H. Cardot, and F. Serratosa, A deep neural network architecture to estimate node assignment costs for the graph edit distance, Syntactic and Structural Pattern Recognition, pp.326-336, 2018.

X. Cortés and F. Serratosa, Learning graph-matching edit-costs based on the optimality of the oracle's node correspondences, Pattern Recognition Letters, vol.56, pp.22-29, 2015.

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.30, p.1650005, 2016.

H. Drucker and B. C. , Support vector regression machines, Advances in Neural Information Processing Systems (NIPS), p.155161, 1996.

T. Hastie and R. F. Tibshirani, Boosting and additive trees, The Elements of Statistical Learning, pp.337-384, 2009.

H. W. Kuhn, The hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.2, pp.83-97, 1955.

M. Leordeanu, R. Sukthankar, and M. Hebert, Unsupervised learning for graph matching, International journal of computer vision, vol.96, pp.28-45, 2012.

C. Moreno-garcía, C. X. Francisco, and S. Francesc, A graph repository for learning error-tolerant graph matching. Syntactic and Structural Pattern Recognition, 2016.

M. Neuhaus and H. Bunke, Self-organizing maps for learning the edit costs in graph matching, IEEE Transactions on Systems, Man, and Cybernetics, vol.35, pp.503-514, 2005.

M. Neuhaus and H. Bunke, Automatic learning of cost functions for graph edit distance, Information Sciences, vol.177, pp.239-247, 2007.

R. Raveaux, M. Martineau, and C. D. , Learning graph matching with a graph-based perceptron in a classification context, pp.49-58, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01576056

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 F. M. , Predicting the correctness of node assignments in bipartite graph matching, Pattern Recognition Letters, vol.69, pp.8-14, 2016.

J. Schmidhuber, Deep learning in neural networks: An overview, Neural Networks, vol.61, pp.85-117, 2015.

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.

F. Serratosa, A. Sol-ribalta, and C. X. , Automatic learning of edit costs based on interactive and adaptive graph recognition, pp.152-163, 2011.