KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum K-Defective Clique Problem

Jin et al. "KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum K-Defective Clique Problem." AAAI Conference on Artificial Intelligence, 2024. doi:10.1609/AAAI.V38I18.30061

[Jin et al. "KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum K-Defective Clique Problem." AAAI Conference on Artificial Intelligence, 2024.](https://mlanthology.org/aaai/2024/jin2024aaai-kd/) doi:10.1609/AAAI.V38I18.30061

@inproceedings{jin2024aaai-kd,
  title     = {{KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum K-Defective Clique Problem}},
  author    = {Jin, Mingming and Zheng, Jiongzhi and He, Kun},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2024},
  pages     = {20735-20742},
  doi       = {10.1609/AAAI.V38I18.30061},
  url       = {https://mlanthology.org/aaai/2024/jin2024aaai-kd/}
}