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,513 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.0321577e-05 |
| 7,320 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB | 4.7629325e-05 |
| 8,809 | Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks | 2024 | VLDB | 4.4443756e-05 |
| 9,390 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 4.3441378e-05 |
| 9,398 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 4.3441378e-05 |
| 9,484 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 4.3341665e-05 |
| 10,037 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 4.1945683e-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,162 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.0001358105 |
| 1,450 | Distance-Constraint Reachability Computation in Uncertain Graphs | 2011 | VLDB | 0.00011925844 |
| 2,684 | Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms | 2016 | SIGMOD | 8.3136866e-05 |
| 5,751 | Effective and Efficient Dynamic Graph Coloring | 2018 | VLDB | 5.3409543e-05 |
| 6,171 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB | 5.170101e-05 |
| 6,172 | An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs | 2019 | VLDB | 5.170101e-05 |
| 7,542 | Spheres of Influence for More Effective Viral Marketing | 2016 | SIGMOD | 4.7156855e-05 |
Previous
Page 1 / 1
Next