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 (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology)
- 3. Donghang Cui (Beijing Institute of Technology)
- 4. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{dai_sigmod24,
title = {{Theoretically and Practically Efficient Maximum Defective Clique Search}},
author = {Dai, Qiangqiang and Li, Rong-Hua and Cui, Donghang and Wang, Guoren},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3677142},
url = {https://dl.acm.org/doi/10.1145/3677142},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,540 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 5.2528121e-05 |
| 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.093636e-05 |
| 10,367 | Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements | 2026 | SIGMOD | 5.093636e-05 |
| 10,423 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD | 5.093636e-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,831 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB | 7.0862742e-05 |
| 4,015 | The Web as a graph | 2000 | PODS | 6.9542071e-05 |
| 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD | 6.5731244e-05 |
| 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD | 6.3533812e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,831 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB |
| 2 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 3 | 1,509 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB |
| 4 | 3,993 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 5 | 5,471 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD |
| 6 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 7 | 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 8 | 9,548 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB |
| 9 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 10 | 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |