Z. Abu-aisheh, B. Gaüzere, S. Bougleux, J. Y. Ramel, L. Brun et al., Graph edit distance contest 2016: Results and future challenges, Pattern Recognit. Lett, vol.100, pp.96-103, 2017.

Z. Abu-aisheh, R. Raveaux, and J. Ramel, A graph database repository and performance evaluation metrics for graph edit distance, GbRPR 2015, vol.9069, pp.138-147, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01168809

L. Babai, Graph isomorphism in quasipolynomial time, STOC 2016, pp.684-697, 2016.

D. B. Blumenthal, S. Bougleux, J. Gamper, and L. Brun, Ring based approximation of graph edit distance, S+SSPR 2018, vol.11004, pp.293-303, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01865194

D. B. Blumenthal, S. Bougleux, J. Gamper, and L. Brun, GEDLIB: A C++ library for graph edit distance computation, GbRPR 2019, vol.11510, pp.14-24
URL : https://hal.archives-ouvertes.fr/hal-02162839

, , 2019.

D. B. Blumenthal, S. Bougleux, J. Gamper, and L. Brun, Upper bounding GED via transformations to LSAPE based on rings and machine learning, 2019.

D. B. Blumenthal, E. Daller, S. Bougleux, L. Brun, and J. Gamper, Quasimetric graph edit distance as a compact quadratic assignment problem, ICPR 2018, pp.934-939, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01865214

D. B. Blumenthal and J. Gamper, Correcting and speeding-up bounds for non-uniform graph edit distance, pp.131-134, 2017.

D. B. Blumenthal and J. Gamper, Improved lower bounds for graph edit distance, IEEE Trans. Knowl. Data Eng, vol.30, issue.3, pp.503-516, 2018.

D. B. Blumenthal and J. Gamper, On the exact computation of the graph edit distance, Pattern Recognit. Lett, 2018.

P. Bonacich, Power and centrality: A family of measures, Am. J. Sociol, vol.92, issue.5, pp.1170-1182, 1987.

N. Boria, D. B. Blumenthal, S. Bougleux, and L. Brun, Improved local search for graph edit distance, 2019.

N. Boria, S. Bougleux, and L. Brun, Approximating GED using a stochastic generator and multistart IPFP, pp.460-469, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01865351

S. Bougleux, L. Brun, V. Carletti, P. Foggia, B. Gaüzère et al., Graph edit distance as a quadratic assignment problem, Pattern Recognit. Lett, vol.87, pp.38-46, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01613964

S. Bougleux, B. Gaüzère, D. B. Blumenthal, and L. Brun, Fast linear sum assignment with error-correction and no cost constraints, Pattern Recognit. Lett, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02110718

S. Bougleux, B. Gaüzère, and L. Brun, Graph edit distance as a quadratic program, ICPR 2016, pp.1701-1706, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01418937

S. Bougleux, B. Gaüzère, and L. Brun, A Hungarian algorithm for error-correcting graph matching, GbRPR 2017, vol.10310, pp.118-127, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01540920

S. Brin and L. Page, The anatomy of a large-scale hypertextual web search engine, Comput. Netw, vol.30, issue.1-7, pp.107-117, 1998.

L. Brun, P. Foggia, and M. Vento, Trends in graph-based representations for pattern recognition, Pattern Recognit. Lett, 2018.

H. Bunke and G. Allermann, Inexact graph matching for structural pattern recognition, Pattern Recognit. Lett, vol.1, issue.4, pp.90033-90041, 1983.

V. Carletti, B. Gaüzère, L. Brun, and M. Vento, Approximate graph edit distance computation combining bipartite matching and exact neighborhood substructure distance, GbRPR 2015, vol.9069, pp.188-197, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01389626

C. C. Chang and C. J. Lin, LIBSVM: A library for support vector machines, ACM Trans. Intell. Syst. Technol, vol.2, issue.3, p.27, 2011.

D. Conte, P. Foggia, C. Sansone, and M. Vento, Thirty years of graph matching in pattern recognition, Int. J. Pattern Recognit. Artif. Intell, vol.18, issue.3, pp.265-298, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01408706

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, A (sub)graph isomorphism algorithm for matching large graphs, IEEE Trans. Pattern Anal. Mach. Intell, vol.26, issue.10, pp.1367-1372, 2004.

X. Cortés, F. Serratosa, and C. F. Moreno-garcía, On the influence of node centralities on graph edit distance for graph classification, GbRPR 2015, vol.9069, pp.231-241, 2015.

É. Daller, S. Bougleux, B. Gaüzère, and L. Brun, Approximate graph edit distance by several local searches in parallel, pp.149-158, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01664529

M. Ferrer, F. Serratosa, and K. Riesen, A first step towards exact graph edit distance using bipartite graph matching, GbRPR 2015, vol.9069, pp.77-86, 2015.

A. Fischer, C. Y. Suen, V. Frinken, K. Riesen, and H. Bunke, Approximation of graph edit distance based on Hausdorff matching, Pattern Recognit, vol.48, issue.2, pp.331-343, 2015.

P. Foggia, G. Percannella, and M. Vento, Graph matching and learning in pattern recognition in the last 10 years, Int. J. Pattern Recognit. Artif. Intell, vol.28, issue.1, p.40, 2014.

M. Frank and P. Wolfe, An algorithm for quadratic programming, Nav. Res. Logist. Q, vol.3, issue.12, pp.95-110, 1956.

X. Gao, B. Xiao, D. Tao, and X. Li, A survey of graph edit distance, Pattern Anal. Appl, vol.13, issue.1, pp.113-129, 2010.

B. Gaüzère, S. Bougleux, K. Riesen, and L. Brun, Approximate graph edit distance guided by bipartite matching of bags of walks, S+SSPR 2014, vol.8621, pp.73-82, 2014.

G. Guennebaud and B. Jacob, Eigen v3, 2010.

, Gurobi Optimization LLC: Gurobi Optimizer Reference Manual

E. R. Henry, Classification and Uses of Finger Prints, Routledge, 1900.

D. Justice and A. Hero, A binary linear programming formulation of the graph edit distance, IEEE Trans. Pattern Anal. Mach. Intell, vol.28, issue.8, pp.1200-1214, 2006.

N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol.4, issue.4, pp.373-396, 1984.

H. W. Kuhn, The Hungarian method for the assignment problem, Nav. Res. Logist. Q, vol.2, issue.1-2, pp.83-97, 1955.

L. Digabel and S. , Algorithm 909: NOMAD: Nonlinear optimization with the MADS algorithm, ACM Trans. Math. Softw, vol.37, issue.4, p.15, 2011.

L. Gall and F. , Powers of tensors and fast matrix multiplication, pp.296-303, 2014.

L. Lee, A. Lumsdaine, and J. Siek, The Boost Graph Library: User Guide and Reference Manual, 2002.

M. Leordeanu, M. Hebert, and R. Sukthankar, An integer projected fixed point method for graph matching and MAP inference, pp.1114-1122, 2009.

J. Lerouge, Z. Abu-aisheh, R. Raveaux, P. Héroux, and S. Adam, Exact graph edit distance computation using a binary linear program, S+SSPR 2016, vol.10029, pp.485-495, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01491027

J. Lerouge, Z. Abu-aisheh, R. Raveaux, P. Héroux, and S. Adam, New binary linear programming formulation to compute the graph edit distance, Pattern Recognit, vol.72, pp.254-265, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01619308

C. L. Lin, Hardness of approximating graph transformation problem, Algorithms and Computation, vol.834, pp.74-82, 1994.

J. Munkres, Algorithms for the assignment and transportation problems, SIAM J. Appl. Math, vol.5, issue.1, pp.32-38, 1957.

S. Nissen, Implementation of a fast artificial neural network library (FANN), 2003.

E. Ozdemir and C. Gunduz-demir, A hybrid classification model for digital pathology using structural and statistical pattern recognition, IEEE Trans. Med. Imaging, vol.32, issue.2, pp.474-483, 2013.

K. Riesen, Structural Pattern Recognition with Graph Edit Distance, Advances in Computer Vision and Pattern Recognition

, , 2015.

K. Riesen and H. Bunke, IAM graph database repository for graph based pattern recognition and machine learning, S+SSPR 2008, vol.5342, pp.287-297, 2008.

K. Riesen and H. Bunke, Approximate graph edit distance computation by means of bipartite graph matching, Image Vis. Comput, vol.27, issue.7, pp.950-959, 2009.

K. Riesen and H. Bunke, Graph Classification and Clustering Based on Vector Space Embedding, Series in Machine Perception and Artificial Intelligence, vol.77, 2010.

K. Riesen, H. Bunke, and A. Fischer, Improving graph edit distance approximation by centrality measures, ICPR 2014, pp.3910-3914, 2014.

K. Riesen and M. Ferrer, Predicting the correctness of node assignments in bipartite graph matching, Pattern Recognit. Lett, vol.69, pp.8-14, 2016.

K. Riesen, M. Ferrer, A. Fischer, and H. Bunke, Approximation of graph edit distance in quadratic time, GbRPR 2015, vol.9069, pp.3-12, 2015.

K. Riesen, A. Fischer, and H. Bunke, Combining bipartite graph matching and beam search for graph edit distance approximation, ANNPR 2014, vol.8774, pp.117-128, 2014.

K. Riesen, A. Fischer, and H. Bunke, Computing upper and lower bounds of graph edit distance in cubic time, ANNPR 2014, vol.8774, pp.129-140, 2014.

K. Riesen, A. Fischer, and H. Bunke, Improved graph edit distance approximation with simulated annealing, GbRPR 2017, vol.10310, pp.222-231

, , 2017.

A. Sanfeliu and K. S. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. Syst. Man Cybern, vol.13, issue.3, pp.353-362, 1983.

I. Schomburg, A. Chang, C. Ebeling, M. Gremse, C. Heldt et al., BRENDA, the enzyme database: Updates and major new developments, Nucleic Acids Res, vol.32, pp.431-433, 2004.

M. Stauffer, A. Fischer, and K. Riesen, A novel graph database for handwritten word images, S+SSPR 2016, vol.10029, pp.553-563, 2016.

M. Stauffer, T. Tschachtli, A. Fischer, and K. Riesen, A survey on applications of bipartite graph edit distance, GbRPR 2017, vol.10310, pp.242-252

, , 2017.

V. Strassen, Gaussian elimination is not optimal, Numer. Math, vol.13, issue.4, pp.354-356, 1969.

T. Uno, Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs, ISAAC 1997, vol.1350, pp.92-101, 1997.

T. Uno, A fast algorithm for enumerating bipartite perfect matchings, LNCS, vol.2223, pp.367-379, 2001.

M. Vento, A long trip in the charming world of graphs for pattern recognition, Pattern Recognit, vol.48, issue.2, pp.291-301, 2015.

X. Wang, X. Ding, A. K. Tung, S. Ying, and H. Jin, An efficient graph indexing method, pp.210-221, 2012.

Z. Zeng, A. K. Tung, J. Wang, J. Feng, and L. Zhou, Comparing stars: On approximating graph edit distance, PVLDB, vol.2, issue.1, pp.25-36, 2009.

X. Zhao, C. Xiao, X. Lin, W. Zhang, and Y. Wang, Efficient structure similarity searches: a partition-based approach, VLDB J, vol.27, issue.1, pp.53-78, 2018.

W. Zheng, L. Zou, X. Lian, D. Wang, and D. Zhao, Graph similarity search with edit distance constraint in large graph databases, CIKM 2013, pp.1595-1600, 2013.

W. Zheng, L. Zou, X. Lian, D. Wang, and D. Zhao, Efficient graph similarity search over large graph databases, IEEE Trans. Knowl. Data Eng, vol.27, issue.4, pp.964-978, 2015.