Back to papers
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism
Summary: QuickSI: an efficient subgraph isomorphism tester that lowers verification cost in graph search. A feature-based index accelerates filtering for scalable retrieval from large graph collections; experiments show gains over prior methods.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 9682
- Venue
- VLDB
- Year
- 2008
- Pagerank
- 0.00018725237
- Overall Rank
- 428 | 97.03%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 20 of 70 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 8,117 |
Fast Local Subgraph Counting |
2024 |
VLDB |
5.5419908e-05 |
| 8,759 |
GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases |
2010 |
SIGMOD |
5.4338813e-05 |
| 9,523 |
ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs |
2020 |
VLDB |
5.3218384e-05 |
| 9,717 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
5.2849709e-05 |
| 9,757 |
View-based Explanations for Graph Neural Networks |
2024 |
SIGMOD |
5.2759752e-05 |
| 9,781 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
5.2719963e-05 |
| 9,843 |
Path-centric Cardinality Estimation for Subgraph Matching |
2025 |
VLDB |
5.2617062e-05 |
| 9,936 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
5.2356043e-05 |
| 10,062 |
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,096 |
NeuSO: Neural Optimizer for Subgraph Queries |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,199 |
R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,264 |
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination |
2026 |
VLDB |
5.1725247e-05 |
| 10,640 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
5.1725247e-05 |
| 10,740 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
5.1725247e-05 |
| 10,951 |
gSWORD: GPU-accelerated Sampling for Subgraph Counting |
2024 |
SIGMOD |
5.1725247e-05 |
| 10,997 |
Towards a Converged Relational-Graph Optimization Framework |
2024 |
SIGMOD |
5.1725247e-05 |
| 11,569 |
Simulation-based Approximate Graph Pattern Matching |
2020 |
SIGMOD |
5.1725247e-05 |
| 11,574 |
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query |
2020 |
SIGMOD |
5.1725247e-05 |
| 12,188 |
iGraph in Action: Performance Analysis of Disk-Based Graph Indexing Techniques |
2011 |
SIGMOD |
5.1725247e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers