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 (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology)
- 3. Meihao Liao (Beijing Institute of Technology)
- 4. Hongzhi Chen (ByteDance)
- 5. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{dai_sigmod22,
title = {{Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach}},
author = {Dai, Qiangqiang and Li, Rong-Hua and Liao, Meihao and Chen, Hongzhi and Wang, Guoren},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3526143},
url = {https://dl.acm.org/doi/10.1145/3514221.3526143},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,007 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB | 6.3052426e-05 |
| 6,666 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.698709e-05 |
| 8,187 | Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks | 2024 | VLDB | 5.3652509e-05 |
| 8,699 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 5.2717835e-05 |
| 9,713 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 5.124163e-05 |
| 9,714 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 5.124163e-05 |
| 10,613 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 4.9605343e-05 |
| 10,880 | GPU-Accelerated eta-threshold Decomposition for Uncertain Graphs | 2026 | VLDB | 4.9605343e-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,069 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.00012164865 |
| 1,266 | Distance-Constraint Reachability Computation in Uncertain Graphs | 2011 | VLDB | 0.00011256294 |
| 2,072 | Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms | 2016 | SIGMOD | 9.0668141e-05 |
| 5,768 | An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs | 2019 | VLDB | 5.9831541e-05 |
| 5,790 | Effective and Efficient Dynamic Graph Coloring | 2018 | VLDB | 5.9762012e-05 |
| 5,966 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB | 5.9142578e-05 |
| 7,613 | Spheres of Influence for More Effective Viral Marketing | 2016 | SIGMOD | 5.4675059e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,644 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB |
| 2 | 10,613 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD |
| 3 | 11,573 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 4 | 8,187 | Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks | 2024 | VLDB |
| 5 | 2,754 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 6 | 1,591 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 7 | 8,913 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 8 | 6,489 | Clustering Uncertain Graphs | 2018 | VLDB |
| 9 | 4,155 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 10 | 5,500 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD |