Scaling Up k-Clique Percolation Community Detection
Summary: Introduces Quasi-KCPC—an incomplete KCPC obtainable during maximal-clique enumeration—and two scalable KCPC algorithms: a Quasi-KCPC–pruned maximal-clique-adjacency traversal and a (k−1)-clique listing approach that assembles k-cliques via maximal-clique links. Adds incremental vertex/edge update routines and reports up to ~100× speedups over prior KCPC methods on 12 large real graphs. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yue Zeng
- 2. Miao Qiao
- 3. Rong-Hua Li
- 4. Hongchao Qin
- 5. Guoren Wang
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 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 7,268 | Top-K Structural Diversity Search in Large Networks | 2013 | VLDB | 4.7817823e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,681 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 4.1945683e-05 |
| 10,037 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 4.1945683e-05 |
| 2,542 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB | 8.5794502e-05 |
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 370 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00025415479 |
| 10,074 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 4.1945683e-05 |
| 4,984 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD | 5.7867286e-05 |
| 13,251 | Scalable Community Detection via Parallel Correlation Clustering | 2021 | VLDB | - |
| 4,145 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD | 6.4122551e-05 |
| 1,650 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00011013428 |