Maximal Defective Clique Enumeration
Summary: Introduces maximal s-defective clique enumeration (s>0) to relax cliques; uses polynomial-delay reverse-search. Pivot-based branch-and-bound with degeneracy-order optimization beats 2^n time; extends to hereditary properties. (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. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{dai_sigmod23,
title = {{Maximal Defective Clique Enumeration}},
author = {Dai, Qiangqiang and Li, Rong-Hua and Liao, Meihao and Wang, Guoren},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3588931},
url = {https://dl.acm.org/doi/10.1145/3588931},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD | 5.9336489e-05 |
| 9,540 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 5.2528121e-05 |
| 9,548 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB | 5.2528121e-05 |
| 9,551 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 5.2528121e-05 |
| 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,332 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 5.093636e-05 |
| 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.093636e-05 |
| 11,256 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 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,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00010164289 |
| 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.5574945e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,509 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB |
| 2 | 5,471 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD |
| 3 | 5,374 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD |
| 4 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 5 | 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 6 | 5,556 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD |
| 7 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 8 | 9,548 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB |
| 9 | 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 10 | 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |