A new exact maximum clique algorithm for large and massive sparse graphs
Computers & Operations Research, Volume 66, 2016.
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 dif...
Full Text (Upload PDF)
PPT (Upload PPT)