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
- 2. Anthony K.H. Tung
- 3. Jianyong Wang
- 4. Jianhua Feng
- 5. Lizhu Zhou
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 172 | Algorithmics and Applications of Tree and Graph Searching | 2002 | PODS | 0.00038837872 |
| 202 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00034881375 |
| 302 | BLINKS: Ranked Keyword Searches on Graphs | 2007 | SIGMOD | 0.00028343691 |
| 334 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00027077424 |
| 337 | Bidirectional Expansion For Keyword Search on Graph Databases | 2005 | VLDB | 0.00027002505 |
| 750 | A Platform Based on the Multi-dimensional Data Model for Analysis of Bio-Molecular Structures | 2003 | VLDB | 0.0001718364 |
| 895 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB | 0.00015498104 |
| 2,432 | Towards Graph Containment Search and Indexing | 2007 | VLDB | 8.8247178e-05 |
| 3,206 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD | 7.3855924e-05 |
| 4,402 | Approximate Matching of Hierarchical Data Using pq-Grams | 2005 | VLDB | 6.2086707e-05 |
| 6,734 | An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data | 2006 | VLDB | 4.9434384e-05 |
Previous
Page 1 / 1
Next