Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach
Summary: FastQC: a fast branch-and-bound method for maximal gamma-quasi-cliques with a co-designed pruning and branching strategy. Divide-and-conquer boosts performance; experiments on real graphs show up to two orders of magnitude speedup over prior methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kaiqiang Yu
- 2. Cheng Long
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,709 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD | 5.3622436e-05 |
| 9,396 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 4.3399748e-05 |
| 9,404 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 4.3399748e-05 |
| 10,074 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 4.1905499e-05 |
| 10,604 | Truss Decomposition in Hypergraphs | 2025 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,527 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.5982912e-05 |
| 4,737 | Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions | 2021 | SIGMOD | 5.9529218e-05 |
| 5,125 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD | 5.6741053e-05 |
| 5,148 | Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach | 2021 | VLDB | 5.6572863e-05 |
| 6,599 | One Set to Cover All Maximal Cliques Approximately | 2022 | SIGMOD | 4.9929128e-05 |
Previous
Page 1 / 1
Next