Nucleus Decomposition Revisited: An Efficient Counting-Based Approach
Summary: Replaces explicit enumeration of combinatorially many s-cliques in (r,s)-nucleus decomposition with a counting-based Clique Path Index encoding clique-search paths. Supports direct computation, dynamic updates, and connectivity maintenance, scaling to larger s and denser graphs. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Wenqian Zhang (University of New South Wales)
- 2. Zhengyi Yang (University of New South Wales)
- 3. Dong Wen (University of New South Wales)
- 4. Yi Ding (University of New South Wales)
- 5. Wenjie Zhang (University of New South Wales)
- 6. Xuemin Lin (Shanghai Jiao Tong University)
BibTeX Citation
@inproceedings{zhang_sigmod26,
title = {{Nucleus Decomposition Revisited: An Efficient Counting-Based Approach}},
author = {Zhang, Wenqian and Yang, Zhengyi and Wen, Dong and Ding, Yi and Zhang, Wenjie and Lin, Xuemin},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3802092},
url = {https://dl.acm.org/doi/10.1145/3802092},
year = {2026}
}
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 20 of 20 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 | 8,623 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB |
| 2 | 9,301 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD |
| 3 | 1,416 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB |
| 4 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 5 | 793 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB |
| 6 | 1,640 | Distance-generalized Core Decomposition | 2019 | SIGMOD |
| 7 | 2,826 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 8 | 2,083 | Fast Hierarchy Construction for Dense Subgraphs | 2017 | VLDB |
| 9 | 6,368 | Theoretically and Practically Efficient Parallel Nucleus Decomposition | 2022 | VLDB |
| 10 | 9,695 | Parallel Algorithms for Hierarchical Nucleus Decomposition | 2024 | SIGMOD |