Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound
Summary: BBRes prunes defective-clique branch-and-bound by early-solving tractable subinstances with a synergistic branching strategy, improving worst-case complexity. A novel double-coloring/max-flow upper bound further accelerates search, yielding ≥2× speedups on many datasets. (summarized by gpt-5.6-luna on Aug 17 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Kewu Yang (Harbin Engineering University)
- 2. Kaiqiang Yu (Nanjing University)
- 3. Shengxin Liu (Harbin Engineering University)
- 4. Zhaoquan Gu (Harbin Engineering University; Peng Cheng Laboratory)
BibTeX Citation
@article{yang_vldb26,
title = {{Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound}},
author = {Yang, Kewu and Yu, Kaiqiang and Liu, Shengxin and Gu, Zhaoquan},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {9},
pages = {2439--2451},
doi = {10.14778/3819518.3819562},
url = {https://doi.org/10.14778/3819518.3819562},
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 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 645 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00015213733 |
| 3,189 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB | 7.5528776e-05 |
| 3,860 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD | 6.9663663e-05 |
| 4,526 | Maximal Defective Clique Enumeration | 2023 | SIGMOD | 6.5606177e-05 |
| 5,552 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD | 6.0860432e-05 |
| 6,914 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB | 5.6465623e-05 |
| 7,043 | Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach | 2023 | SIGMOD | 5.6141221e-05 |
| 8,884 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.2559789e-05 |
| 9,678 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 5.1435978e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,678 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB |
| 2 | 4,612 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 3 | 10,860 | Maximum Defective Biclique Search in Large Bipartite Graphs | 2026 | VLDB |
| 4 | 3,189 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB |
| 5 | 6,914 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB |
| 6 | 4,526 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 7 | 8,884 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 8 | 3,610 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 9 | 5,552 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 10 | 3,860 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |