[1]
J. Gao, Z. Xu, R. Li, and M. Yin, “An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs”, AAAI, vol. 36, no. 9, pp. 10174-10183, Jun. 2022.