Simulation-based Approximate Graph Pattern Matching
Summary: Simulation-based approximate graph pattern matching for attributed graphs; efficient matches via graph simulations. It captures reasonable matches missed by existing algorithms, addressing performance and recall gaps. (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
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 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 616 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.00019068362 |
| 749 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD | 0.00017193776 |
| 1,125 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD | 0.00013829006 |
| 1,280 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD | 0.00012838714 |
| 1,419 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00012072488 |
| 1,444 | SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs | 2010 | VLDB | 0.00011941836 |
| 2,402 | TreeSpan: Efficiently Computing Similarity All-Matching | 2012 | SIGMOD | 8.87387e-05 |
| 2,557 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB | 8.5484449e-05 |
| 5,017 | Event Pattern Matching over Graph Streams | 2015 | VLDB | 5.7505967e-05 |
| 5,786 | Capturing Topology in Graph Pattern Matching | 2012 | VLDB | 5.3256482e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,402 | TreeSpan: Efficiently Computing Similarity All-Matching | 2012 | SIGMOD | 8.87387e-05 |
| 9,614 | Auto-Approximation of Graph Computing | 2014 | VLDB | 4.3136057e-05 |
| 5,017 | Event Pattern Matching over Graph Streams | 2015 | VLDB | 5.7505967e-05 |
| 4,748 | Diversified Top-k Graph Pattern Matching | 2013 | VLDB | 5.9432853e-05 |
| 916 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB | 0.00015326675 |
| 2,943 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB | 7.8463193e-05 |
| 1,806 | Incremental Graph Pattern Matching | 2011 | SIGMOD | 0.00010478244 |
| 5,786 | Capturing Topology in Graph Pattern Matching | 2012 | VLDB | 5.3256482e-05 |
| 11,563 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD | 4.1905499e-05 |
| 1,419 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00012072488 |