Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods
Summary: Holistic cross-field survey of learning-based GED predictors, separating interpretable and non-interpretable approaches and their design principles. Presents App-BMao, a simple, interpretable combinatorial GED estimator with bounded resources; on three datasets it outperforms all prior learning-based methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Mouyi Xu (University of Sydney)
- 2. Lijun Chang (University of Sydney)
BibTeX Citation
@inproceedings{xu_sigmod25,
title = {{Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods}},
author = {Xu, Mouyi and Chang, Lijun},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3725304},
url = {https://dl.acm.org/doi/10.1145/3725304},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 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,115 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00012117375 |
| 3,423 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB | 7.4260662e-05 |
| 3,933 | TaGSim: Type-aware Graph Similarity Learning and Computation | 2022 | VLDB | 7.00884e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,341 | Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks | 2024 | SIGMOD |
| 2 | 7,152 | Boosting Graph Similarity Search through Pre-Computation | 2021 | SIGMOD |
| 3 | 11,756 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 4 | 1,115 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB |
| 5 | 12,021 | NED: An Inter-Graph Node Metric Based On Edit Distance | 2017 | VLDB |
| 6 | 10,939 | Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond | 2025 | VLDB |
| 7 | 3,933 | TaGSim: Type-aware Graph Similarity Learning and Computation | 2022 | VLDB |
| 8 | 10,524 | A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs | 2026 | VLDB |
| 9 | 8,126 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD |
| 10 | 3,423 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB |