Graph edit distance contest 2016: Results and future challenges, Pattern Recognit. Lett, vol.100, pp.96-103, 2017. ,
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
Graph isomorphism in quasipolynomial time, STOC 2016, pp.684-697, 2016. ,
Ring based approximation of graph edit distance, S+SSPR 2018, vol.11004, pp.293-303, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01865194
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.
Upper bounding GED via transformations to LSAPE based on rings and machine learning, 2019. ,
Quasimetric graph edit distance as a compact quadratic assignment problem, ICPR 2018, pp.934-939, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01865214
Correcting and speeding-up bounds for non-uniform graph edit distance, pp.131-134, 2017. ,
Improved lower bounds for graph edit distance, IEEE Trans. Knowl. Data Eng, vol.30, issue.3, pp.503-516, 2018. ,
On the exact computation of the graph edit distance, Pattern Recognit. Lett, 2018. ,
Power and centrality: A family of measures, Am. J. Sociol, vol.92, issue.5, pp.1170-1182, 1987. ,
Improved local search for graph edit distance, 2019. ,
Approximating GED using a stochastic generator and multistart IPFP, pp.460-469, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01865351
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
Fast linear sum assignment with error-correction and no cost constraints, Pattern Recognit. Lett, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02110718
Graph edit distance as a quadratic program, ICPR 2016, pp.1701-1706, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01418937
A Hungarian algorithm for error-correcting graph matching, GbRPR 2017, vol.10310, pp.118-127, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01540920
The anatomy of a large-scale hypertextual web search engine, Comput. Netw, vol.30, issue.1-7, pp.107-117, 1998. ,
Trends in graph-based representations for pattern recognition, Pattern Recognit. Lett, 2018. ,
Inexact graph matching for structural pattern recognition, Pattern Recognit. Lett, vol.1, issue.4, pp.90033-90041, 1983. ,
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
LIBSVM: A library for support vector machines, ACM Trans. Intell. Syst. Technol, vol.2, issue.3, p.27, 2011. ,
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
A (sub)graph isomorphism algorithm for matching large graphs, IEEE Trans. Pattern Anal. Mach. Intell, vol.26, issue.10, pp.1367-1372, 2004. ,
On the influence of node centralities on graph edit distance for graph classification, GbRPR 2015, vol.9069, pp.231-241, 2015. ,
Approximate graph edit distance by several local searches in parallel, pp.149-158, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01664529
A first step towards exact graph edit distance using bipartite graph matching, GbRPR 2015, vol.9069, pp.77-86, 2015. ,
Approximation of graph edit distance based on Hausdorff matching, Pattern Recognit, vol.48, issue.2, pp.331-343, 2015. ,
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. ,
An algorithm for quadratic programming, Nav. Res. Logist. Q, vol.3, issue.12, pp.95-110, 1956. ,
A survey of graph edit distance, Pattern Anal. Appl, vol.13, issue.1, pp.113-129, 2010. ,
Approximate graph edit distance guided by bipartite matching of bags of walks, S+SSPR 2014, vol.8621, pp.73-82, 2014. ,
, Eigen v3, 2010.
, Gurobi Optimization LLC: Gurobi Optimizer Reference Manual
Classification and Uses of Finger Prints, Routledge, 1900. ,
A binary linear programming formulation of the graph edit distance, IEEE Trans. Pattern Anal. Mach. Intell, vol.28, issue.8, pp.1200-1214, 2006. ,
A new polynomial-time algorithm for linear programming, Combinatorica, vol.4, issue.4, pp.373-396, 1984. ,
The Hungarian method for the assignment problem, Nav. Res. Logist. Q, vol.2, issue.1-2, pp.83-97, 1955. ,
Algorithm 909: NOMAD: Nonlinear optimization with the MADS algorithm, ACM Trans. Math. Softw, vol.37, issue.4, p.15, 2011. ,
Powers of tensors and fast matrix multiplication, pp.296-303, 2014. ,
The Boost Graph Library: User Guide and Reference Manual, 2002. ,
An integer projected fixed point method for graph matching and MAP inference, pp.1114-1122, 2009. ,
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
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
Hardness of approximating graph transformation problem, Algorithms and Computation, vol.834, pp.74-82, 1994. ,
Algorithms for the assignment and transportation problems, SIAM J. Appl. Math, vol.5, issue.1, pp.32-38, 1957. ,
Implementation of a fast artificial neural network library (FANN), 2003. ,
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. ,
Structural Pattern Recognition with Graph Edit Distance, Advances in Computer Vision and Pattern Recognition ,
, , 2015.
IAM graph database repository for graph based pattern recognition and machine learning, S+SSPR 2008, vol.5342, pp.287-297, 2008. ,
Approximate graph edit distance computation by means of bipartite graph matching, Image Vis. Comput, vol.27, issue.7, pp.950-959, 2009. ,
Graph Classification and Clustering Based on Vector Space Embedding, Series in Machine Perception and Artificial Intelligence, vol.77, 2010. ,
Improving graph edit distance approximation by centrality measures, ICPR 2014, pp.3910-3914, 2014. ,
Predicting the correctness of node assignments in bipartite graph matching, Pattern Recognit. Lett, vol.69, pp.8-14, 2016. ,
Approximation of graph edit distance in quadratic time, GbRPR 2015, vol.9069, pp.3-12, 2015. ,
Combining bipartite graph matching and beam search for graph edit distance approximation, ANNPR 2014, vol.8774, pp.117-128, 2014. ,
Computing upper and lower bounds of graph edit distance in cubic time, ANNPR 2014, vol.8774, pp.129-140, 2014. ,
Improved graph edit distance approximation with simulated annealing, GbRPR 2017, vol.10310, pp.222-231 ,
, , 2017.
A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. Syst. Man Cybern, vol.13, issue.3, pp.353-362, 1983. ,
BRENDA, the enzyme database: Updates and major new developments, Nucleic Acids Res, vol.32, pp.431-433, 2004. ,
A novel graph database for handwritten word images, S+SSPR 2016, vol.10029, pp.553-563, 2016. ,
A survey on applications of bipartite graph edit distance, GbRPR 2017, vol.10310, pp.242-252 ,
, , 2017.
Gaussian elimination is not optimal, Numer. Math, vol.13, issue.4, pp.354-356, 1969. ,
Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs, ISAAC 1997, vol.1350, pp.92-101, 1997. ,
A fast algorithm for enumerating bipartite perfect matchings, LNCS, vol.2223, pp.367-379, 2001. ,
A long trip in the charming world of graphs for pattern recognition, Pattern Recognit, vol.48, issue.2, pp.291-301, 2015. ,
An efficient graph indexing method, pp.210-221, 2012. ,
Comparing stars: On approximating graph edit distance, PVLDB, vol.2, issue.1, pp.25-36, 2009. ,
Efficient structure similarity searches: a partition-based approach, VLDB J, vol.27, issue.1, pp.53-78, 2018. ,
Graph similarity search with edit distance constraint in large graph databases, CIKM 2013, pp.1595-1600, 2013. ,
Efficient graph similarity search over large graph databases, IEEE Trans. Knowl. Data Eng, vol.27, issue.4, pp.964-978, 2015. ,