Branch and bound algorithms for the maximum clique problem under a unified framework

Brazilian Computer Society. Journal

Renato Carmo²  ge³  Alexandre Zü⁴ 

[1] , Curitiba, Brasil;Departamento de Informácnico da Universidade Federal do Paranática da UFPR Centro Polité

关键词: Maximum clique;    Exact solution;    Branch and bound;   

DOI  :  10.1007/s13173-011-0050-6

学科分类：农业科学（综合）

来源: Springer U K

【 摘 要 】

In this paper we review branch and bound-based algorithms proposed for the exact solution of the maximum clique problem and describe them under a unifying conceptual framework. As a proof of concept, we actually implemented eight of these algorithms as parametrized versions of one single general branch and bound algorithm.

【 授权许可】

CC BY