1.
Li C-M, Quan Z. An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem. AAAI [Internet]. 2010 Jul. 3 [cited 2026 May 7];24(1):128-33. Available from: https://ojs.aaai.org/index.php/AAAI/article/view/7536