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
- 2. Xi Zhao
- 3. Lemin Kong
- 4. Xiaofang Zhou
- 5. Jia Li
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 |
|---|---|---|---|---|
| 951 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00015106325 |
| 3,752 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB | 6.7879009e-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 |
| 3,873 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB | 6.6779082e-05 |
| 8,069 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD | 4.5934204e-05 |
| 8,524 | GABoost: Graph Alignment Boosting via Local Optimum Escape | 2024 | SIGMOD | 4.4937074e-05 |
Previous
Page 1 / 1
Next