A Quadratic Programming Approach to the Graph Edit Distance Problem
Published on Jul 12, 20079763 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