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

摘要

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.