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 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,913 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.2361195e-05 |
| 9,713 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 5.124163e-05 |
| 10,572 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 4.9605343e-05 |
| 10,639 | Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements | 2026 | SIGMOD | 4.9605343e-05 |
| 10,684 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD | 4.9605343e-05 |
| 10,868 | Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound | 2026 | VLDB | 4.9605343e-05 |
| 10,930 | Maximum Defective Biclique Search in Large Bipartite Graphs | 2026 | VLDB | 4.9605343e-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,000 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB | 7.7498183e-05 |
| 3,591 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD | 7.1655231e-05 |
| 4,075 | The Web as a graph | 2000 | PODS | 6.8052587e-05 |
| 4,155 | Maximal Defective Clique Enumeration | 2023 | SIGMOD | 6.7613076e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,597 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 2 | 10,395 | Efficient Querying of Maximum Connectivity-Based Quasi-Cliques in Large Graphs | 2027 | SIGMOD |
| 3 | 5,066 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD |
| 4 | 10,671 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 5 | 10,868 | Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound | 2026 | VLDB |
| 6 | 10,930 | Maximum Defective Biclique Search in Large Bipartite Graphs | 2026 | VLDB |
| 7 | 4,155 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 8 | 6,933 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB |
| 9 | 3,591 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 10 | 8,913 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |