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

Computers & Operations Research, Volume 66, 2016.

Cited by: 15|Bibtex|Views22|Links
EI

Abstract:

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...

Code:

Data:

Your rating :
0

 

Tags
Comments