An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem

Chu Min Li, Zhe Quan. An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem. In Maria Fox, David Poole, editors, Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010. pages 128-133, AAAI Press, 2010. [doi]

Abstract

Abstract is missing.