Comparing stars: On approximating graph edit distance, PVLDB, vol.2, issue.1, pp.25-36, 2009. ,
Speeding up graph edit distance computation with a bipartite heuristic, MLG, pp.21-24, 2007. ,
An exact graph edit distance algorithm for solving pattern recognition problems, ICPRAM, pp.271-278, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01168816
Exact computation of graph edit distance for uniform and non-uniform metric edit costs, pp.211-221, 2017. ,
CSI GED: An efficient approach for graph edit similarity computation, ICDE, pp.265-276, 2016. ,
New binary linear programming formulation to compute the graph edit distance, Pattern Recogn, vol.72, pp.254-265, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01619308
Fast suboptimal algorithms for the computation of graph edit distance, S+SSPR, pp.163-172, 2006. ,
Improving approximate graph edit distance using genetic algorithms, S+SSPR, pp.63-72, 2014. ,
Approximation of graph edit distance based on Hausdorff matching, Pattern Recogn, vol.48, issue.2, pp.331-343, 2015. ,
Combining bipartite graph matching and beam search for graph edit distance approximation, pp.117-128, 2014. ,
Learning heuristics to reduce the overestimation of bipartite graph edit distance approximation, MLDM, pp.17-31, 2015. ,
A binary linear programming formulation of the graph edit distance, IEEE Trans. Pattern Anal. Mach. Intell, vol.28, issue.8, pp.1200-1214, 2006. ,
Fast linear sum assignment with error-correction and no cost constraints, Pattern Recogn. Lett, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02110718
Approximate graph edit distance computation by means of bipartite graph matching, Image Vis. Comput, vol.27, issue.7, pp.950-959, 2009. ,
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.
Efficient Graph Similarity Search Over Large Graph Databases, IEEE Trans. Knowl. Data Eng, vol.27, issue.4, pp.964-978, 2015. ,
Approximate graph edit distance guided by bipartite matching of bags of walks, S+SSPR, pp.73-82, 2014. ,
Approximate graph edit distance computation combining bipartite matching and exact neighborhood substructure distance, GbRPR, pp.188-197, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01389626
Fast computation of bipartite graph matching, Pattern Recogn. Lett, vol.45, pp.244-250, 2014. ,
, Speeding up fast bipartite graph matching through a new cost matrix, Int. J. Pattern Recogn, vol.29, issue.2, 2015.
Approximating graph edit distance using GNCCP, S+SSPR, pp.496-506, 2016. ,
Graph edit distance as a quadratic assignment problem, Pattern Recogn. Lett, vol.87, pp.38-46, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01613964
Approximate graph edit distance by several local searches in parallel, ICPRAM, pp.149-158, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01664529
Graph edit distance as a quadratic program, ICPR, pp.1701-1706, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01418937
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. ,
A survey on applications of bipartite graph edit distance, pp.242-252, 2017. ,
Graph edit distance contest 2016: Results and future challenges, Pattern Recogn. Lett, vol.100, pp.96-103, 2017. ,