DBScholar

Back to papers

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)

Paper ID
7465
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,273 | 29.52%
DOI
10.1145/3802092

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Rank Cited Paper Year Venue Pagerank
102 Truss Decomposition in Massive Networks 2012 VLDB 0.00034255289
189 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00026114928
590 Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis 2013 VLDB 0.0001605572
793 Streaming Algorithms for k-core Decomposition 2013 VLDB 0.00013978774
825 K-Core Decomposition of Large Networks on a Single PC 2016 VLDB 0.00013779895
1,069 Truss-based Community Search: a Truss-equivalence Based Indexing Approach 2017 VLDB 0.00012323497
1,416 Local Algorithms for Hierarchical Dense Subgraph Discovery 2019 VLDB 0.00010839488
2,083 Fast Hierarchy Construction for Dense Subgraphs 2017 VLDB 9.1976617e-05
3,312 On Querying Historical K-Cores 2021 VLDB 7.5309892e-05
3,503 Accelerating Truss Decomposition on Heterogeneous Processors 2020 VLDB 7.3592701e-05
3,821 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 7.0933895e-05
4,158 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.8628196e-05
5,977 Maximal D-truss Search in Dynamic Directed Graphs 2023 VLDB 6.0219619e-05
6,368 Theoretically and Practically Efficient Parallel Nucleus Decomposition 2022 VLDB 5.8975125e-05
7,144 Towards Distributed Bitruss Decomposition on Bipartite Graphs 2022 VLDB 5.6910663e-05
7,408 Efficient Triangle-Connected Truss Community Search In Dynamic Graphs 2023 VLDB 5.6243648e-05
8,149 Efficient Index for Temporal Core Queries over Bipartite Graphs 2024 VLDB 5.4784885e-05
9,301 Accelerating Core Decomposition in Billion-Scale Hypergraphs 2025 SIGMOD 5.289545e-05
9,691 A Flexible Framework for Query-oriented Interactive Community Search 2025 VLDB 5.2351259e-05
9,695 Parallel Algorithms for Hierarchical Nucleus Decomposition 2024 SIGMOD 5.2351259e-05
Previous Page 1 / 1 Next

Semantically Similar Papers