A. [. Filatov, I. Gitis, and . Kil, Graph-based handwritten digit string recognition, Proceedings of 3rd International Conference on Document Analysis and Recognition, pp.845-848, 1995.
DOI : 10.1109/ICDAR.1995.602033

N. [. Anstreicher and . Brixius, A new bound for the quadratic assignment problem based on convex quadratic programming, Mathematical Programming, pp.341-357, 2001.
DOI : 10.1007/PL00011402

E. L. Allgower, K. A. Georgas93-]-h, S. O. Almohamad, and . Duffuaa, Numerical continuation methods A linear programming approach for the weighted graph matching problem. Transaction on pattern analysis and machine intelligence, 1990.

A. [. Borwein and . Lewis, Convex Analysis and Nonlinear Optimization, 2000.

S. Belongie, J. Malik, and J. Puzicha, Shape matching and object recognition using shape contexts. Transaction on pattern analysis and machine intelligence, 2002.

]. F. Boo89 and . Bookstein, Principal warps: thin-plate splines and the decomposition of deformations . Transaction on pattern analysis and machine intelligence, pp.567-585, 1989.

E. [. Luo and . Hancock, Alignment and correspondence using sigular value decomposition. Lecture notes in computer science, pp.226-235, 2000.

L. [. Boyd and . Vandenberghe, Convex Optimization. Camb, Probabilistic subgraph matching based on convex relaxation . Lecture notes in computer science, pp.171-186, 2003.

[. Cela, Qaudratuc assignment problem library, 2007.

P. [. Cordella, C. Foggia, M. Sansone, and . Vento, Performance evaluation of the VF graph matching algorithm, Proceedings 10th International Conference on Image Analysis and Processing, pp.1038-1041, 1991.
DOI : 10.1109/ICIAP.1999.797762

R. K. Chu97-]-fan and . Chung, Spectral Graph Theory, 1997.

T. Caelli and S. Kosinov, An eigenspace projection clustering method for inexact graph matching. Transaction on pattern analysis and machine intelligence, 2004.

M. Carcassoni and E. R. Hancock, Spectral correspondence for point pattern matching, Pattern Recognition, vol.36, issue.1, pp.193-204, 2002.
DOI : 10.1016/S0031-3203(02)00054-7

[. D. B99-]-d and . Bertsekas, Nonlinear programming, Athena Scientific, 1999.

P. [. Conte, C. Foggia, M. Sansone, and . Vento, THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION, International Journal of Pattern Recognition and Artificial Intelligence, vol.18, issue.03, pp.265-298, 2004.
DOI : 10.1142/S0218001404003228

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

T. [. Cremers, C. Kohlberger, and . Schnor, Evaluation of convex optimization techniques for the weighted graph-matching problem in computer vision, 2001.

P. [. Frank and . Wolfe, An algorithm for quadratic programming, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.95-110, 1956.
DOI : 10.1002/nav.3800030109

D. S. Johnson and M. R. Garey, Computer and intractability: A guide to the theory of NP-completeness, 1979.

M. [. Brein, E. Remm, and . Sonnhammer, Inparanoid: a comprehensive database of eukaryothic orthologs, Nucleic acids research, vol.33, 2005.

]. H. Kuh55 and . Kuhn, The hungarian method for the assignment problem, Naval Research, vol.2, pp.83-97, 1955.

R. S. Lee and J. N. Liu, An oscillatory elastic graph matching model for recognition of offline handwritten Chinese characters, 1999 Third International Conference on Knowledge-Based Intelligent Information Engineering Systems. Proceedings (Cat. No.99TH8410), pp.284-287, 1999.
DOI : 10.1109/KES.1999.820179

L. F. Mcginnis, Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem, Operations Research, vol.31, issue.2, pp.277-291, 1983.
DOI : 10.1287/opre.31.2.277

]. J. Mil69 and . Milnor, Topology from the Differentiable Viewpoint, 1969.

S. [. Newman, D. J. Strogatz, and . Watts, Random graphs with arbitrary degree distributions and their applications, Physical Review E, vol.64, issue.2, 2001.
DOI : 10.1103/PhysRevE.64.026118

J. [. Singh, B. Xu, and . Berger, Pairwise global alignment of protein interaction networks by matching neighborhood topology. Fill in, 0, 2007.

]. R. Roc70 and . Rockafeller, Convex Analysis, 1970.

A. [. Gold and . Rangarajan, A graduated assignment algorithm for graph matching. Transaction on pattern analysis and machine intelligence, 1996.
DOI : 10.1109/34.491619

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.693

J. [. Shapiro and . Brady, Feature-based correspondence: an eigenvector approach, Image and Vision Computing, vol.10, issue.5, pp.283-288, 1992.
DOI : 10.1016/0262-8856(92)90043-3

L. [. Schmidt, K. Yamada, and . Yamamoto, A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices, Journal of the ACM, vol.23, issue.3, pp.433-445, 1976.
DOI : 10.1145/321958.321963

R. William and . Taylor, Protein structure comparison using bipartite graph matching and its application to protein structure classification, Molecular and Cellular Proteomics, pp.334-339, 2002.

]. J. Ull76 and . Ullmann, An algorithm for subgraph isomorphism, Journal of the Assoc. for Computing Machinery, vol.23, pp.433-445, 1976.

S. Umeyama, An eigendecomposition approach to weighted graph matching problems . Transaction on pattern analysis and machine intelligence, 1988.
DOI : 10.1109/34.6778

H. Fang, W. , and E. R. Hancock, Correspondence matching using kernel principal components analysis and label consistency constraints, Pattern Recognition, 2005.

T. Walter, J. Klein, P. Massin, and A. Erignay, Detection of the median axis of vessels in retinal images, European Journal of Ophthalmology, vol.13, issue.2, 2003.

Y. Wang, F. Makedon, J. Ford, and H. Huang, A bipartite graph matching framework for finding correspondences between structural elements in two proteins, The 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, pp.2972-2975, 2004.
DOI : 10.1109/IEMBS.2004.1403843