A branch-and-bound algorithm for the maximum clique problem—is presented with a vertex order taken and with a new pruning strategy.
GNU General Public License v3.0GPL-3.0