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 (Tsinghua University)
- 2. Da Yan (Indiana University)
- 3. Tianhao Wu (Tsinghua University)
- 4. Zhongyi Huang (Tsinghua University)
- 5. Qin Zhang (Indiana University)
BibTeX Citation
@inproceedings{cheng_sigmod25,
title = {{Computing Approximate Graph Edit Distance via Optimal Transport}},
author = {Cheng, Qihao and Yan, Da and Wu, Tianhao and Huang, Zhongyi and Zhang, Qin},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3709673},
url = {https://dl.acm.org/doi/10.1145/3709673},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,245 | Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond | 2025 | VLDB | 5.2032182e-05 |
| 10,718 | A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs | 2026 | VLDB | 4.9769913e-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 |
|---|---|---|---|---|
| 1,133 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00011892544 |
| 2,635 | Neural Subgraph Counting with Wasserstein Estimator | 2022 | SIGMOD | 8.1954989e-05 |
| 3,161 | A Learned Sketch for Subgraph Counting | 2021 | SIGMOD | 7.5771609e-05 |
| 3,453 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB | 7.287012e-05 |
| 3,570 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB | 7.195367e-05 |
| 3,995 | TaGSim: Type-aware Graph Similarity Learning and Computation | 2022 | VLDB | 6.8646339e-05 |
| 6,000 | Neural Attributed Community Search at Billion Scale | 2023 | SIGMOD | 5.9170672e-05 |
| 7,208 | Boosting Graph Similarity Search through Pre-Computation | 2021 | SIGMOD | 5.5836037e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,036 | GEDet: Detecting Erroneous Nodes with A Few Examples | 2021 | VLDB |
| 2 | 1,133 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB |
| 3 | 7,208 | Boosting Graph Similarity Search through Pre-Computation | 2021 | SIGMOD |
| 4 | 12,065 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 5 | 10,718 | A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs | 2026 | VLDB |
| 6 | 3,995 | TaGSim: Type-aware Graph Similarity Learning and Computation | 2022 | VLDB |
| 7 | 12,322 | NED: An Inter-Graph Node Metric Based On Edit Distance | 2017 | VLDB |
| 8 | 3,453 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB |
| 9 | 11,196 | Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods | 2025 | SIGMOD |
| 10 | 9,245 | Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond | 2025 | VLDB |