Theoretically and Practically Efficient Maximum Defective Clique Search
Summary: Theoretically and practically efficient max k-defective clique search using new branch-reduction rules and pivot-based branching. O(m gamma_k^n) with gamma_k<2 (k=1–3: 1.466–1.889); color- and non-neighbor-based pruning plus an ordering-based preprocessor; 300-graph experiments show 3 orders of magnitude speedups over prior work. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qiangqiang Dai
- 2. Rong-Hua Li
- 3. Donghang Cui
- 4. Guoren Wang
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,396 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 4.3399748e-05 |
| 10,074 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 4.1905499e-05 |
| 10,076 | Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements | 2026 | SIGMOD | 4.1905499e-05 |
| 10,134 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,696 | The Web as a graph | 2000 | PODS | 6.829057e-05 |
| 4,085 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB | 6.4580586e-05 |
| 4,984 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD | 5.7811667e-05 |
| 5,021 | Maximal Defective Clique Enumeration | 2023 | SIGMOD | 5.7481039e-05 |
Previous
Page 1 / 1
Next