Gao, Jian, et al. “An Exact Algorithm With New Upper Bounds for the Maximum K-Defective Clique Problem in Massive Sparse Graphs”. Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 9, June 2022, pp. 10174-83, doi:10.1609/aaai.v36i9.21257.