A new exact maximum clique algorithm for large and massive sparse graphs

Pablo San Segundo,Alvaro Lopez,Panos M. Pardalos

Computers & Operations Research（2016）

引用 47|浏览74

暂无评分

摘要

This paper describes a new very efficient branch-and-bound exact maximum clique algorithm BBMCSP, designed for large and massive sparse graphs which appear frequently in real life problems from different fields.

查看译文

关键词

Branch and bound,Bitstring,Massive,Sparse,Maximum clique

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要