Efficient Maximum k-Defective Clique Computation with Improved Time Complexity
Summary: Introduces kDC, a framework for exact maximum k-defective clique with sub-2^n time, via non-fully-adjacent-first branching, excess-removal, and high-degree reductions. Separates worst-case techniques from practical optimizations; adds a tighter upper bound, two reductions, and fast initial solution; benchmarks on 290 graphs show kDC vastly outperforms KDBB. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lijun Chang (University of Sydney)
BibTeX Citation
@inproceedings{chang_sigmod23,
title = {{Efficient Maximum k-Defective Clique Computation with Improved Time Complexity}},
author = {Chang, Lijun},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3617313},
url = {https://dl.acm.org/doi/10.1145/3617313},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 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,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 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 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 |
|---|---|---|---|---|
| 102 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00034255289 |
| 1,018 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | 2012 | VLDB | 0.0001263063 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 2 | 10,930 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 3 | 5,471 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD |
| 4 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 5 | 3,831 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB |
| 6 | 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 7 | 3,993 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 8 | 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 9 | 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 10 | 9,548 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB |