Fast Local Subgraph Counting
Summary: Tree-decomposition-based method for local k-node subgraph counting Q=(p,o): decompose pattern p into best tree T and reduce global subgraph-isomorphism to a constrained homomorphism on T plus per-tree-node subgraph-isomorphisms. Applies symmetry-breaking and a novel multi-join algorithm to speed per-node isomorphism counts; single-core single-machine implementation outperforms prior approaches and is aimed at producing GNN-ready node features. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qiyan Li (Chinese University of Hong Kong)
- 2. Jeffrey Xu Yu (Chinese University of Hong Kong)
BibTeX Citation
@article{li_vldb24,
title = {{Fast Local Subgraph Counting}},
author = {Li, Qiyan and Yu, Jeffrey Xu},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {8},
pages = {1967--1980},
doi = {10.14778/3659437.3659451},
url = {https://doi.org/10.14778/3659437.3659451},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,361 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB | 5.1868213e-05 |
| 10,788 | Subgraph Enumeration: Beyond Tree Decomposition | 2026 | VLDB | 4.9793485e-05 |
| 10,882 | Efficient GPU-Accelerated Local Subgraph Counting | 2026 | VLDB | 4.9793485e-05 |
| 11,279 | Efficient and Adaptive Estimation of Local Triadic Coefficients | 2025 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 30 of 30 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 | 3,160 | A Learned Sketch for Subgraph Counting | 2021 | SIGMOD |
| 2 | 1,443 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB |
| 3 | 10,485 | Nucleus Decomposition Revisited: An Efficient Counting-Based Approach | 2026 | SIGMOD |
| 4 | 3,767 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |
| 5 | 1,046 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD |
| 6 | 1,181 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB |
| 7 | 5,218 | Efficient Streaming Subgraph Isomorphism with Graph Neural Networks | 2021 | VLDB |
| 8 | 10,788 | Subgraph Enumeration: Beyond Tree Decomposition | 2026 | VLDB |
| 9 | 11,286 | Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach | 2025 | VLDB |
| 10 | 10,882 | Efficient GPU-Accelerated Local Subgraph Counting | 2026 | VLDB |