LI, Chu-Min; QUAN, Zhe. An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem. Proceedings of the AAAI Conference on Artificial Intelligence, [S. l.], v. 24, n. 1, p. 128–133, 2010. DOI: 10.1609/aaai.v24i1.7536. Disponível em: https://ojs.aaai.org/index.php/AAAI/article/view/7536. Acesso em: 7 may. 2026.