Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond
Summary: Cast GED as a Fused Gromov-Wasserstein OT problem and propose FGWAlign, an OT-based solver with random exploration, projection postprocessing, and multi-relational (edge-label) support. O(|V||E|) time, O(|V|^2) space; >80% error reduction and 15–60× speedups vs 12 baselines, enabling scalable labeled-graph alignment and anomaly detection. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Jianheng Tang (Hong Kong University of Science and Technology)
- 2. Xi Zhao (Hong Kong University of Science and Technology)
- 3. Lemin Kong (Chinese University of Hong Kong)
- 4. Xiaofang Zhou (Hong Kong University of Science and Technology)
- 5. Jia Li (Hong Kong University of Science and Technology)
BibTeX Citation
@article{tang_vldb25,
title = {{Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond}},
author = {Tang, Jianheng and Zhao, Xi and Kong, Lemin and Zhou, Xiaofang and Li, Jia},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {10},
pages = {3641--3654},
doi = {10.14778/3748191.3748221},
url = {https://doi.org/10.14778/3748191.3748221},
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 7 of 7 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,522 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB | 7.3491042e-05 |
| 3,548 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB | 7.3214417e-05 |
| 3,933 | TaGSim: Type-aware Graph Similarity Learning and Computation | 2022 | VLDB | 7.00884e-05 |
| 8,126 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD | 5.4827332e-05 |
| 8,729 | GABoost: Graph Alignment Boosting via Local Optimum Escape | 2024 | SIGMOD | 5.3766157e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,524 | A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs | 2026 | VLDB |
| 2 | 5,581 | Subgraph Matching over Graph Federation | 2022 | VLDB |
| 3 | 11,756 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 4 | 7,152 | Boosting Graph Similarity Search through Pre-Computation | 2021 | SIGMOD |
| 5 | 1,115 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB |
| 6 | 12,021 | NED: An Inter-Graph Node Metric Based On Edit Distance | 2017 | VLDB |
| 7 | 3,933 | TaGSim: Type-aware Graph Similarity Learning and Computation | 2022 | VLDB |
| 8 | 10,764 | Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods | 2025 | SIGMOD |
| 9 | 3,423 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB |
| 10 | 8,126 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD |