Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer

Summary: Introduces a divide-and-conquer algorithm for locally h-clique densest subgraph discovery, avoiding redundant computation while enumerating multiple locally optimal dense regions. Experiments on 15 large graphs show up to 100× speedups over the state of the art. (summarized by gpt-5.6-luna on Aug 28 2026)

Paper ID: h97f4676ba3a17b32
Venue: VLDB
Year: 2026
Pagerank: 4.9769913e-05
Overall Rank: 10,818 | 27.30%
DOI: 10.14778/3828612.3828616
PDF: Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

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

Authors

1. Yingli Zhou (Chinese University of Hong Kong)
2. Taohua Huang (Xidian University)
3. Yixiang Fang (Chinese University of Hong Kong)

BibTeX Citation

@article{zhou_vldb26,
        title = {{Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer}},
        author = {Zhou, Yingli and Huang, Taohua and Fang, Yixiang},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {10},
        pages = {2577--2590},
        doi = {10.14778/3828612.3828616},
        url = {https://doi.org/10.14778/3828612.3828616},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 28 of 28 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
131	Discovering Large Dense Subgraphs in Massive Graphs	2005	VLDB	0.00030236369
274	3-HOP: A High-Compression Indexing Scheme for Reachability Query	2009	SIGMOD	0.00022480767
561	Densest Subgraph in Streaming and MapReduce	2012	VLDB	0.00016390753
589	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.00015898419
988	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.00012654453
1,209	KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs	2020	VLDB	0.00011529112
2,044	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	9.1373547e-05
2,088	Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms	2016	SIGMOD	9.064678e-05
2,905	Piggybacking on Social Networks	2013	VLDB	7.874369e-05
3,066	Finding Locally Densest Subgraphs: A Convex Programming Approach	2022	VLDB	7.6862279e-05
3,251	On Querying Historical K-Cores	2021	VLDB	7.4903737e-05
3,412	Scaling Up k-Clique Densest Subgraph Detection	2023	SIGMOD	7.321657e-05
3,791	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD	7.0158046e-05
4,359	Anchored Densest Subgraph	2022	SIGMOD	6.6371259e-05
4,924	A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery	2022	SIGMOD	6.3492725e-05
5,976	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	5.9272031e-05
6,214	I/O Efficient ECC Graph Decomposition via Graph Reduction	2016	VLDB	5.8459668e-05
6,655	Efficient Parallel D-core Decomposition at Scale	2024	VLDB	5.717615e-05
7,814	A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery	2024	SIGMOD	5.4469653e-05
7,834	Densest Multipartite Subgraph Search in Heterogeneous Information Networks	2024	VLDB	5.4412454e-05
8,973	An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery	2024	SIGMOD	5.2462145e-05
8,983	Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery	2023	SIGMOD	5.2429402e-05
9,922	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB	5.1079647e-05
10,454	Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance	2026	SIGMOD	4.9769913e-05
10,573	Efficient and Scalable Directed Densest Subgraph Discovery	2026	SIGMOD	4.9769913e-05
11,228	In-depth Analysis of Densest Subgraph Discovery in a Unified Framework	2025	VLDB	4.9769913e-05
11,329	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.9769913e-05
11,922	Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques	2022	VLDB	4.9769913e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	4,359	Anchored Densest Subgraph	2022	SIGMOD
2	10,433	Bound-Tightened Densest Subgraph Discovery on GPU	2026	SIGMOD
3	9,922	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB
4	3,791	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD
5	7,814	A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery	2024	SIGMOD
6	10,454	Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance	2026	SIGMOD
7	3,066	Finding Locally Densest Subgraphs: A Convex Programming Approach	2022	VLDB
8	2,044	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB
9	11,329	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB
10	8,973	An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery	2024	SIGMOD