1. Bridging the Gap Between Graph Edit Distance and Kernel Machines;Neuhaus,2007
2. A quadratic programming approach to the graph edit distance problem;Neuhaus,2007
3. Approximate graph edit distance computation by means of bipartite graph matching;Riesen;Image Vis. Comput.,2009
4. Approximation of graph edit distance based on Hausdorff matching;Fischer;Pattern Recognit.,2015
5. Runzhong Wang, Tianqi Zhang, Tianshu Yu, Junchi Yan, Xiaokang Yang, Combinatorial learning of graph edit distance via dynamic embedding, in: 2021 IEEE/CVF Conf. on Computer Vision and Pattern Recognition, Los Alamitos, CA, USA, 2021, pp. 5237–5246.