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

K. Riesen, M. Neuhaus, and H. Bunke, Graph embedding in vector spaces by means of prototype selection, " in Graph-Based Representations in Pattern Recognition, pp.383-393, 2007.

A. Torsello and E. R. Hancock, Graph embedding using tree edit-union, Pattern Recognition, vol.40, issue.5, pp.1393-1405, 2007.
DOI : 10.1016/j.patcog.2006.09.006

D. Emms, R. Wilson, and E. Hancock, Graph embedding using quantum commute times, " in Graph-Based Representations in Pattern Recognition, pp.371-382, 2007.

K. Riesen, M. Neuhaus, and H. Bunke, Bipartite graph matching for computing the edit distance of graphs Graph- Based Representations in, pp.1-12, 2007.

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

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

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, 2014.

J. E. Hopcroft and R. M. Karp, A n5/2 algorithm for maximum matchings in bipartite, 12th Annual Symposium on Switching and Automata Theory (swat 1971), pp.122-125, 1971.
DOI : 10.1109/SWAT.1971.1

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

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

R. Jonker and A. Volgenant, A shortest augmenting path algorithm for dense and sparse linear assignment problems Computing, pp.325-340, 1987.

T. Koopmans and M. J. Beckmann, Assignment problems and the location of economic activities Cowles Foundation for Research in Economics, Cowles Foundation Discussion Papers, vol.4, 1955.

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

J. R. Ullman, An Algorithm for Subgraph Isomorphism, Journal of the ACM, vol.23, issue.1, pp.31-42, 1976.
DOI : 10.1145/321921.321925

L. Cordella, P. Foggia, C. Sansone, and M. Vento, A (sub)graph isomorphism algorithm for matching large graphs, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.10, pp.1367-1372, 2004.
DOI : 10.1109/TPAMI.2004.75

V. Bonnici, R. Giugno, A. Pulvirenti, D. Shasha, and A. Ferro, A subgraph isomorphism algorithm and its application to biochemical data, BMC Bioinformatics, vol.14, issue.Suppl 7, 2013.
DOI : 10.1093/nar/gkq973

J. Mcgregor, Relational consistency algorithms and their application in finding subgraph and graph isomorphisms, Information Sciences, vol.19, issue.3, pp.229-250, 1979.
DOI : 10.1016/0020-0255(79)90023-9

J. Larrosa and G. Valiente, Constraint satisfaction algorithms for graph pattern matching, Mathematical Structures in Computer Science, vol.12, issue.04, pp.403-422, 2002.
DOI : 10.1017/S0960129501003577

S. Zampelli, Y. Deville, and C. Solnon, Solving subgraph isomorphism problems with constraint programming, Constraints, vol.23, issue.1, pp.327-353, 2010.
DOI : 10.1007/s10601-009-9074-3
URL : https://hal.archives-ouvertes.fr/hal-01381438

C. Solnon, AllDifferent-based filtering for subgraph isomorphism, Artificial Intelligence, vol.174, issue.12-13, pp.850-864, 2010.
DOI : 10.1016/j.artint.2010.05.002
URL : https://hal.archives-ouvertes.fr/hal-01381476

J. Ullmann, Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism, Journal of Experimental Algorithmics, vol.15, issue.1, 2010.
DOI : 10.1145/1671970.1921702

H. He and A. Singh, Graphs-at-a-time, Proceedings of the 2008 ACM SIGMOD international conference on Management of data , SIGMOD '08, pp.405-417, 2008.
DOI : 10.1145/1376616.1376660

H. Shang, Y. Zhang, X. Lin, and J. X. Yu, Taming verification hardness, Proc. VLDB Endow, pp.364-375, 2008.
DOI : 10.14778/1453856.1453899

S. Zhang, S. Li, and J. Yang, GADDI, Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology, EDBT '09, 2009.
DOI : 10.1145/1516360.1516384

P. Zhao and J. Han, On graph query optimization in large networks, Proceedings of the VLDB Endowment, pp.340-351, 2010.
DOI : 10.14778/1920841.1920887

W. Han, J. Lee, and J. Lee, Turbo Iso: Towards Ultrafast And Robust Subgraph Isomorphism Search In Large Graph Databases, pp.337-348, 2013.

N. Dahm, H. Bunke, T. Caelli, and Y. Gao, Efficient subgraph matching using topological node feature constraints, Pattern Recognition, vol.48, issue.2, 2014.
DOI : 10.1016/j.patcog.2014.05.018

J. Lee, W. Han, R. Kasperovics, and J. Lee, An indepth comparison of subgraph isomorphism algorithms in graph databases, Proc. VLDB Endow, pp.133-144, 2012.

V. Carletti, P. Foggia, and M. Vento, Performance Comparison of Five Exact Graph Matching Algorithms on Biological Databases, New Trends in Image Analysis and Processing -ICIAP, 2013.
DOI : 10.1007/978-3-642-41190-8_44

V. Carletti, P. Foggia, M. Vento, and X. Jiang, Report on the First Contest on Graph Matching Algorithms for Pattern Search in Biological Databases, Proc. of the 10th IAPR-TC15 Intl. Workshop on Graph-based Representations in Pattern Recognition (GbR2015), ser, pp.178-187, 2015.
DOI : 10.1007/978-3-319-18224-7_18

P. Foggia, C. Sansone, and M. Vento, A Database of Graphs for Isomorphism and Subgraph Isomorphism Benchmarking, pp.176-187, 2001.

M. D. Santo, P. Foggia, C. Sansone, and M. Vento, A large database of graphs and its use for benchmarking graph isomorphism algorithms, Pattern Recognition Letters, vol.24, issue.8, pp.1067-1079, 2003.
DOI : 10.1016/S0167-8655(02)00253-2

V. Carletti, P. Foggia, and M. Vento, A large database of graphs for benchmarking graph isomorphism algorithms, 2015.

S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. Hwang, Complex networks: Structure and dynamics, Physics Reports, vol.424, issue.4-5, pp.175-308, 2006.
DOI : 10.1016/j.physrep.2005.10.009

S. Fankhauser, K. Riesen, and H. Bunke, Speeding up graph edit distance computation through fast bipartite matching Graph-based representations in, pp.102-111, 2011.

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

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

K. Riesen, A. Fischer, and H. Bunke, Improving Approximate Graph Edit Distance Using Genetic Algorithms, " in Structural, Syntactic and Statistical Pattern Recognition, ser. Lecture Notes in Computer Science, pp.63-72, 2014.

M. Ferrer, F. Serratosa, and K. Riesen, A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching, " in Graph Based Representations in Pattern Recognition, pp.77-86, 2015.

V. Carletti, B. Gauzere, B. L. , and M. Vento, Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance, Graph Based Representations in Pattern Recognition. Springer, 2015. [45] G. Sierksma, Linear and Integer Programming: Theory and Practice, 2001.
DOI : 10.1007/978-3-319-18224-7_19
URL : https://hal.archives-ouvertes.fr/hal-01389626

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

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

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

S. Gold, E. Mjolsness, and A. Rangarajan, Clustering with a domain-specific distance measure, Advances in Neural Information Processing Systems, 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

M. Leordeanu, M. Hebert, and R. Sukthankar, An Integer Projected Fixed Point Method for Graph Matching and MAP Inference, Neural Information Processing Systems, 2009.

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

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

S. Bougleux, L. Brun, V. Carletti, P. Foggia, B. Gaüzère et al., A quadratic assignment formulation of the graph edit distance
URL : https://hal.archives-ouvertes.fr/hal-01246709

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