H. Bunke, On a relation between graph edit distance and maximum common subgraph, Pattern Recognition Letters, vol.18, issue.8, pp.689-694, 1997.
DOI : 10.1016/S0167-8655(97)00060-3

H. Bunke, Error correcting graph matching: on the influence of the underlying cost function, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.21, issue.9, pp.917-922, 1999.
DOI : 10.1109/34.790431

H. Bunke and G. Allermann, Inexact graph matching for structural pattern recognition, Pattern Recognition Letters, vol.1, issue.4, pp.245-253, 1983.
DOI : 10.1016/0167-8655(83)90033-8

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, pp.168-177, 2015.
DOI : 10.1007/978-3-319-18224-7_19
URL : https://hal.archives-ouvertes.fr/hal-01389626

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, issue.03, pp.265-298, 2004.
DOI : 10.1142/S0218001404003228
URL : https://hal.archives-ouvertes.fr/hal-01408706

S. Fankhauser, K. Riesen, and H. Bunke, Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching, Graph-based Representations in Pattern Recognition, pp.102-111, 2011.
DOI : 10.1007/978-3-642-20844-7_11

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, pp.77-86
DOI : 10.1007/978-3-319-18224-7_8

P. Foggia, G. Percannella, and M. Vento, Graph matching and learning in pattern recognition on the last ten years, Journal of Pattern Recognition and Artificial Intelligence, vol.28, issue.1, p.2014

B. Gaüzère, S. Bougleux, K. Riesen, and L. Brun, Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks, Structural, Syntactic and Statistical Pattern Recognition, pp.73-82, 2014.

S. Gold, E. Mjolsness, and A. Rangarajan, Clustering with a domain-specific distance measure, Advances in Neural Information Processing Systems, vol.6, pp.96-103, 1994.

S. Gold and A. Rangarajan, A graduated assignment algorithm for graph matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.18, issue.4, pp.377-388, 1996.
DOI : 10.1109/34.491619

S. Gold and A. Rangarajan, Softmax to softassign: Neural network algorithms for combinatorial optimization, Journal of Artificial Neural Networks, vol.2, issue.4, pp.381-399, 1996.

R. Jonker and A. Volgenant, Ein Algorithmus mit k??rzesten alternierenden Wegen f??r dichte und d??nne Zuordnungsprobleme, Computing, vol.1, issue.4, pp.325-340, 1987.
DOI : 10.1007/BF02278710

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

T. C. Koopmans and M. Beckmann, Assignment Problems and the Location of Economic Activities, Econometrica, vol.25, issue.1, pp.53-76, 1957.
DOI : 10.2307/1907742

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109

E. L. Lawler, The Quadratic Assignment Problem, Management Science, vol.9, issue.4, pp.586-599, 1963.
DOI : 10.1287/mnsc.9.4.586

E. L. Lawler, Combinatorial Optimization: Networks and Matroids, 1976.

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

C. Lin, Hardness of approximating graph transformation problem, 5th Annual International Symposium on Algorithms and Computation, pp.74-82, 1994.
DOI : 10.1007/3-540-58325-4_168

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

E. M. Loiola, N. M. De-abreu, P. O. Boaventura-netto, P. Hahn, and T. Querido, A survey for the quadratic assignment problem, European Journal of Operational Research, vol.176, issue.2, pp.657-690, 2007.
DOI : 10.1016/j.ejor.2005.09.032

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

M. Neuhaus and H. Bunke, A Quadratic Programming Approach to the Graph Edit Distance Problem, Graph-Based Representations in Pattern Recognition, pp.92-102, 2007.
DOI : 10.1007/978-3-540-72903-7_9

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 Recognition, vol.48, issue.4, pp.1349-1363, 2015.
DOI : 10.1016/j.patcog.2014.11.002

K. Riesen, A. Fischer, and H. Bunke, Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation, Artificial Neural Networks in Pattern Recognition, pp.117-128, 2014.
DOI : 10.1007/978-3-319-11656-3_11

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

K. Riesen, A. Fischer, and H. Bunke, Estimating Graph Edit Distance Using Lower and Upper Bounds of Bipartite Approximations, International Journal of Pattern Recognition and Artificial Intelligence, vol.29, issue.02, p.2015
DOI : 10.1142/S0218001415500111

K. Riesen, M. Neuhaus, and H. Bunke, Bipartite Graph Matching for Computing the Edit Distance of Graphs, Graph-Based Representations in Pattern Recognition, pp.1-12, 2007.
DOI : 10.1007/978-3-540-72903-7_1

A. Sanfeliu and K. 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.
DOI : 10.1109/TSMC.1983.6313167

F. Serratosa, Fast computation of Bipartite graph matching, Pattern Recognition Letters, vol.45, pp.244-250, 2014.
DOI : 10.1016/j.patrec.2014.04.015

G. Sierksma, Linear and Integer Programming: Theory and Practice, Advances in Applied Mathematics, vol.20013855, 2001.
DOI : 10.1201/b16939

W. Tsai and K. Fu, Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis, IEEE Transactions on Systems, Man, and Cybernetics, vol.9, issue.12, pp.757-768, 1979.
DOI : 10.1109/TSMC.1979.4310127

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

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