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 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,552 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD | 6.0860432e-05 |
| 6,914 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB | 5.6465623e-05 |
| 8,884 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.2559789e-05 |
| 9,677 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 5.1435978e-05 |
| 9,678 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 5.1435978e-05 |
| 9,915 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB | 5.1103839e-05 |
| 10,495 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 4.9793485e-05 |
| 10,537 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 4.9793485e-05 |
| 10,797 | Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound | 2026 | VLDB | 4.9793485e-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,616 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00010066712 |
| 2,320 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.6448197e-05 |
Previous
Page 1 / 1
Next