← Search

Dong Wen

2 accepted papers

2026

Towards Generative Graph Matching for Graph Edit Distance Computation

ICML 2026poster

Graph Edit Distance (GED), which aims to find an edit path with minimum number of edit operations to transform one graph into another, is a fundamental NP-hard problem and a widely used graph similarity measure. Recent matching-based hybrid approaches have demonstrated better scalability than A* sea…

Cited by 0SourceScholar
2025

Towards Unsupervised Training of Matching-based Graph Edit Distance Solver via Preference-aware GAN

NeurIPS 2025poster

Graph Edit Distance (GED) is a fundamental graph similarity metric widely used in various applications. However, computing GED is an NP-hard problem. Recent state-of-the-art hybrid GED solver has shown promising performance by formulating GED as a bipartite graph matching problem, then leveraging a…

Cited by 0SourceScholar