Showing cs.LGShow all
2 papers · 1 filter
cs.LG2025
Towards Unsupervised Training of Matching-based Graph Edit Distance Solver via Preference-aware GAN
Wei Huang, Hanchen Wang, Dong Wen +3
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…
cs.LG2025
DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching
Wei Huang, Hanchen Wang, Dong Wen +3
The Graph Edit Distance (GED) problem, which aims to compute the minimum number of edit operations required to transform one graph into another, is a fundamental challenge in graph…