Convex Graph Invariant Relaxations For Graph Edit Distance

Utkan Onur Candogan, Venkat Chandrasekaran

The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one gra…