[1]
Gao, J., Xu, Z., Li, R. and Yin, M. 2022. 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. 36, 9 (Jun. 2022), 10174-10183. DOI:https://doi.org/10.1609/aaai.v36i9.21257.