Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
Summary: Clique-first branch-and-bound with a new pivoting yields worst-case optimal search space O(3^{n/3}·n^k) for maximal k-defective clique enumeration (Ω lower bound for constant k). Uses diameter-two to get O(n·3^{δ/3}(δΔ)^k), extends to max-k search with up to 10^4× speedups. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Jihoon Jang (Seoul National University)
- 2. Yehyun Nam (Seoul National University)
- 3. Kunsoo Park (Seoul National University)
- 4. Hyunjoon Kim (Hanyang University)
BibTeX Citation
@inproceedings{jang_sigmod26,
title = {{Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space}},
author = {Jang, Jihoon and Nam, Yehyun and Park, Kunsoo and Kim, Hyunjoon},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3769787},
url = {https://dl.acm.org/doi/10.1145/3769787},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 2 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 3 | 1,509 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB |
| 4 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 5 | 3,993 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 6 | 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 7 | 9,548 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB |
| 8 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 9 | 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 10 | 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |