Li, Chu-Min, and Zhe Quan. “An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem”. Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 3, 2010): 128–133. Accessed May 7, 2026. https://ojs.aaai.org/index.php/AAAI/article/view/7536.