Computing Approximate Graph Edit Distance via Optimal Transport
Summary: Uses optimal transport to approximate graph edit distance by deriving vertex coupling from the cost matrix via inverse OT with a learnable Sinkhorn (GEDIOT). Proposes GEDGW (OT + Gromov–Wasserstein) and GEDHOT, a fusion of GEDIOT and GEDGW for improved GED accuracy and generalization. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qihao Cheng
- 2. Da Yan
- 3. Tianhao Wu
- 4. Zhongyi Huang
- 5. Qin Zhang
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,236 | A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs | 2026 | VLDB | 4.1945683e-05 |
| 10,692 | Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond | 2025 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 951 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00015106325 |
| 3,001 | Neural Subgraph Counting with Wasserstein Estimator | 2022 | SIGMOD | 7.7404487e-05 |
| 3,752 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB | 6.7879009e-05 |
| 3,778 | A Learned Sketch for Subgraph Counting | 2021 | SIGMOD | 6.7747398e-05 |
| 3,849 | TaGSim: Type-aware Graph Similarity Learning and Computation | 2022 | VLDB | 6.7064042e-05 |
| 3,862 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB | 6.687769e-05 |
| 6,259 | Neural Attributed Community Search at Billion Scale | 2023 | SIGMOD | 5.1355079e-05 |
| 6,839 | Boosting Graph Similarity Search through Pre-Computation | 2021 | SIGMOD | 4.9109527e-05 |
Previous
Page 1 / 1
Next