KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs
Summary: KClist++ offers a surprisingly simple procedure for exact and near-optimal k-clique densest subgraph discovery at scale. It combines structural results, k-clique listing, and sampling to deliver state-of-the-art performance on massive real-world graphs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Bintao Sun (University of Hong Kong)
- 2. Maximilien Danisch (CNRS; Sorbonne University)
- 3. T-H. Hubert Chan (University of Hong Kong)
- 4. Mauro Sozio (Institut Polytechnique de Paris; Telecom Paris)
BibTeX Citation
@article{sun_vldb20,
title = {{KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs}},
author = {Sun, Bintao and Danisch, Maximilien and Chan, T-H. Hubert and Sozio, Mauro},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {10},
pages = {1628--1640},
doi = {10.14778/3401960.3401962},
url = {https://doi.org/10.14778/3401960.3401962},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 22 of 22 citing papers.
Previous
Page 1 / 1
Next
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 255 | On Triangulation-based Dense Neighborhood Graph Discovery | 2011 | VLDB | 0.00022949287 |
| 269 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00022625826 |
| 560 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB | 0.00016408664 |
| 978 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | 2012 | VLDB | 0.00012699423 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,926 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB |
| 2 | 1,995 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 3 | 1,495 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB |
| 4 | 10,499 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 5 | 10,879 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB |
| 6 | 1,591 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 7 | 3,591 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 8 | 11,383 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 9 | 7,832 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD |
| 10 | 3,396 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD |