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
Improved lower bounds for graph edit distance, IEEE Trans. Knowl. Data Eng, vol.30, issue.3, pp.503-516, 2018. ,
,
Ring based approximation of graph edit distance, S+SSPR 2018, vol.11004, pp.293-303, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01865194
Upper bounding GED via transformations to LSAPE based on rings and machine learning, 2018. ,
Quasimetric graph edit distance as a compact quadratic assignment problem, ICPR 2018, pp.934-939, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01865214
On the exact computation of the graph edit distance, Pattern Recognit. Lett, 2018. ,
,
Approximating GED using a stochastic generator and multistart IPFP, S+SSPR 2018, pp.460-469, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01865351
, Linear sum assignment with edition, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01288288
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
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. ,
,
Efficient graph edit distance computation and verification via anchor-aware lower bound estimation, 2017. ,
Approximate graph edit distance by several local searches in parallel, ICPRAM 2018, 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. ,
Approximate graph edit distance guided by bipartite matching of bags of walks, S+SSPR 2014, vol.8621, pp.73-82, 2014. ,
Gurobi Optimization, LLC: Gurobi optimizer reference manual, Eigen v3, 2010. ,
A binary linear programming formulation of the graph edit distance, IEEE Trans. Pattern Anal. Mach. Intell, vol.28, issue.8, pp.1200-1214, 2006. ,
The Boost Graph Library: User Guide and Reference Manual, 2002. ,
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
Implementation of a fast artificial neural network library (FANN), 2003. ,
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. ,
,
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. ,
,
Combining bipartite graph matching and beam search for graph edit distance approximation, ANNPR 2014, vol.8774, pp.117-128, 2014. ,
Improved graph edit distance approximation with simulated annealing, GbRPR 2017, vol.10310, pp.222-231, 2017. ,
Comparing stars: On approximating graph edit distance, PVLDB, vol.2, issue.1, pp.25-36, 2009. ,
,
Efficient graph similarity search over large graph databases, IEEE Trans. Knowl. Data Eng, vol.27, issue.4, pp.964-978, 2015. ,