Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach
Summary: Pivot-based algorithms accelerate maximal (k, eta)-clique enumeration on uncertain graphs, replacing costly set-enumeration with a new pruning principle. Generalizable to any hereditary property; adds size-constraint pruning and graph-reduction techniques; validated on nine real graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qiangqiang Dai
- 2. Rong-Hua Li
- 3. Meihao Liao
- 4. Hongzhi Chen
- 5. Guoren Wang
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,514 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.9114568e-05 |
| 7,314 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB | 5.7036322e-05 |
| 8,695 | Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks | 2024 | VLDB | 5.4478131e-05 |
| 9,391 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 5.3341661e-05 |
| 9,399 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 5.3341661e-05 |
| 9,480 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 5.3246578e-05 |
| 10,037 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,032 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.00012602512 |
| 1,234 | Distance-Constraint Reachability Computation in Uncertain Graphs | 2011 | VLDB | 0.00011645677 |
| 2,331 | Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms | 2016 | SIGMOD | 8.819467e-05 |
| 5,710 | Effective and Efficient Dynamic Graph Coloring | 2018 | VLDB | 6.1795374e-05 |
| 5,801 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB | 6.1430353e-05 |
| 5,802 | An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs | 2019 | VLDB | 6.1430353e-05 |
| 7,451 | Spheres of Influence for More Effective Viral Marketing | 2016 | SIGMOD | 5.6770416e-05 |
Previous
Page 1 / 1
Next