Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
Summary: Improves exact maximum k-defective clique computation, tightening the exponential base from γ_k to γ_{k−1} and deriving degeneracy/degree-sensitive bounds. A new degree-sequence reduction rule yields orders-of-magnitude practical gains across 290 graphs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lijun Chang (University of Sydney)
BibTeX Citation
@article{chang_vldb25,
title = {{Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance}},
author = {Chang, Lijun},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {2},
pages = {200--212},
doi = {10.14778/3705829.3705839},
url = {https://doi.org/10.14778/3705829.3705839},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.093636e-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 |
|---|---|---|---|---|
| 674 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00015081844 |
| 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD | 6.5731244e-05 |
| 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD | 6.3533812e-05 |
| 9,558 | Efficient k-Clique Count Estimation with Accuracy Guarantee | 2024 | VLDB | 5.2528121e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,993 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 2 | 3,831 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB |
| 3 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 4 | 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 5 | 1,509 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB |
| 6 | 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 7 | 5,471 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD |
| 8 | 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 9 | 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 10 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |