Database Paper Browser

Back to papers

KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs

Summary: KClist++: a simple procedure for the maximal k-clique densest subgraph in large real-world graphs. It fuses k-clique listing with sampling to deliver near-optimal/exact, scalable solutions and state-of-the-art results on graphs with billions of edges. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12068
Venue
VLDB
Year
2020
Pagerank
0.00011322927
Overall Rank
1,570 | 89.08%
DOI
10.14778/3401960.3401962

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 19 of 19 citing papers.

Rank Citing Paper Year Venue Pagerank
2,903 (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs 2022 VLDB 7.9375744e-05
3,575 Finding Locally Densest Subgraphs: A Convex Programming Approach 2022 VLDB 6.9528126e-05
4,145 Scaling Up k-Clique Densest Subgraph Detection 2023 SIGMOD 6.4122551e-05
4,626 Efficient Biclique Counting in Large Bipartite Graphs 2023 SIGMOD 6.0399035e-05
5,265 A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery 2022 SIGMOD 5.5972878e-05
5,355 Anchored Densest Subgraph 2022 SIGMOD 5.5517073e-05
8,630 A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition 2022 VLDB 4.480887e-05
9,403 A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery 2024 SIGMOD 4.3441378e-05
9,406 Efficient k-Clique Count Estimation with Accuracy Guarantee 2024 VLDB 4.3441378e-05
9,557 An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery 2024 SIGMOD 4.3254416e-05
9,951 Parallel Colorful h-star Core Maintenance in Dynamic Graphs 2023 VLDB 4.2405999e-05
10,072 Efficient and Scalable Directed Densest Subgraph Discovery 2026 SIGMOD 4.1945683e-05
10,479 Dupin: A Parallel Framework for Densest Subgraph Discovery in Fraud Detection on Massive Graphs 2025 SIGMOD 4.1945683e-05
10,490 Integral Densest Subgraph Search on Directed Graphs 2025 SIGMOD 4.1945683e-05
10,517 Faster and Efficient Density Decomposition via Proportional Response with Exponential Momentum 2025 SIGMOD 4.1945683e-05
10,535 In-depth Analysis of Densest Subgraph Discovery in a Unified Framework 2025 VLDB 4.1945683e-05
10,681 Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory 2025 VLDB 4.1945683e-05
11,048 Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs 2024 VLDB 4.1945683e-05
11,410 Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques 2022 VLDB 4.1945683e-05
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
110 On Triangulation-based Dense Neighborhood Graph Discovery 2011 VLDB 0.00047892924
279 3-HOP: A High-Compression Indexing Scheme for Reachability Query 2009 SIGMOD 0.00029113513
644 Densest Subgraph in Streaming and MapReduce 2012 VLDB 0.00018748988
1,029 Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification 2012 VLDB 0.00014582849
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
4,081 Efficient Maximum k-Plex Computation over Large Sparse Graphs 2023 VLDB 6.4642761e-05
3,575 Finding Locally Densest Subgraphs: A Convex Programming Approach 2022 VLDB 6.9528126e-05
10,074 Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space 2026 SIGMOD 4.1945683e-05
2,909 Efficient Algorithms for Densest Subgraph Discovery 2019 VLDB 7.9305767e-05
847 Finding the Maximum Clique in Massive Graphs 2017 VLDB 0.00015993322
1,650 Efficient Enumeration of Maximal k-Plexes 2015 SIGMOD 0.00011013428
4,984 Efficient Maximum k-Defective Clique Computation with Improved Time Complexity 2023 SIGMOD 5.7867286e-05
10,681 Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory 2025 VLDB 4.1945683e-05
9,403 A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery 2024 SIGMOD 4.3441378e-05
4,145 Scaling Up k-Clique Densest Subgraph Detection 2023 SIGMOD 6.4122551e-05