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
- 2. Rong-Hua Li
- 3. Meihao Liao
- 4. Guoren Wang
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,489 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD | 5.9220971e-05 |
| 9,391 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 5.3341661e-05 |
| 9,397 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB | 5.3341661e-05 |
| 9,399 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 5.3341661e-05 |
| 10,037 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 5.1725247e-05 |
| 10,074 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.1725247e-05 |
| 11,051 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB | 5.1725247e-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,627 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.0001024273 |
| 2,461 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.6210174e-05 |
Previous
Page 1 / 1
Next