A branch-and-bound algorithm for the maximum clique problem—is presented with a vertex order taken and with a new pruning strategy.
divija96 / clique Goto Github PK
View Code? Open in Web Editor NEWA branch-and-bound algorithm for the maximum clique problem—is presented with a vertex order taken and with a new pruning strategy.
License: GNU General Public License v3.0