en-de
en-es
en-fr
en-sl
en
en-zh
en-pt
0.25
0.5
0.75
1.25
1.5
1.75
2
A Quadratic Programming Approach to the Graph Edit Distance Problem
Published on Feb 4, 20259773 Views
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost edit path between graph