A
Menu
July 03, 2010 conference-paper Open access

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

Proceedings of the AAAI Conference on Artificial Intelligence

DOI: 10.1609/aaai.v24i1.7536 Full text (OA) OpenAlex

Authors 0

  1. Author list not loaded yet.

Cited by 1 stored of 103

1 result

References 0