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
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,813 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD | 4.9187137e-05 |
| 9,390 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 4.3441378e-05 |
| 9,396 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB | 4.3441378e-05 |
| 9,398 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 4.3441378e-05 |
| 10,074 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 4.1945683e-05 |
| 10,134 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD | 4.1945683e-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 |
|---|---|---|---|---|
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |
| 1,029 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | 2012 | VLDB | 0.00014582849 |
Previous
Page 1 / 1
Next