Computing Approximate Graph Edit Distance via Optimal Transport

Qihao Cheng, Da Yan, Tianhao Wu +2

Given a graph pair $(G^1,G^2)$, graph edit distance (GED) is defined as the minimum number of edit operations converting $G^1$ to $G^2$. GED is a fundamental operation widely used…