Comparing Stars: On Approximating Graph Edit Distance
Summary: Proposes three polynomial-time bounds for graph edit distance, enabling scalable approximation for graph data. Introduces AppFull and AppSub for bound-driven graph search; results show pruning and scalability on real and synthetic graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhiping Zeng (Tsinghua University)
- 2. Anthony K.H. Tung (National University of Singapore)
- 3. Jianyong Wang (Tsinghua University)
- 4. Jianhua Feng (Tsinghua University)
- 5. Lizhu Zhou (Tsinghua University)
BibTeX Citation
@article{zeng_vldb09,
title = {{Comparing Stars: On Approximating Graph Edit Distance}},
author = {Zeng, Zhiping and Tung, Anthony K.H. and Wang, Jianyong and Feng, Jianhua and Zhou, Lizhu},
journal = {PVLDB},
series = {{VLDB} '09},
doi = {10.14778/1687627.1687631},
url = {https://doi.org/10.14778/1687627.1687631},
year = {2009}
}
Incoming Citations (Sorted by Pagerank)
Showing 18 of 18 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 786 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB |
| 2 | 7,863 | Efficient Top-k Algorithms for Approximate Substring Matching | 2013 | SIGMOD |
| 3 | 12,365 | NED: An Inter-Graph Node Metric Based On Edit Distance | 2017 | VLDB |
| 4 | 9,268 | Fused Gromov-Wasserstein Alignment for Graph Edit Distance Computation and Beyond | 2025 | VLDB |
| 5 | 3,582 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB |
| 6 | 3,118 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD |
| 7 | 3,461 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB |
| 8 | 11,255 | Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods | 2025 | SIGMOD |
| 9 | 12,109 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 10 | 7,226 | Boosting Graph Similarity Search through Pre-Computation | 2021 | SIGMOD |