2025
CGEDN: Approximation of Graph Edit Distance with Path Generation via Learning Node Matching
ICASSP 2025accepted
Graph Edit Distance (GED) is a classical graph similarity metric. Since exact GED computation is NP-hard, existing GNN-based methods try to approximate GED in polynomial time. However, they still lack support for edge labels or the ability to generate an edit path. To address these limitations, we p…