An Experimental Analysis of Exact Algorithms for the Maximum Clique Problem
Cleverson dos Anjos, Alexandre Prusch Züge, Renato Carmo · Matemática Contemporânea · 2015
We perform an experimental analysis of 10 exact algorithms for the Maximum Clique problem.The comparative results reported imply that, when solving a particular maximum clique problem, if the focus is on minimizing the number of branching steps, the χ + df algorithm is the best option.However, if running time is the main concern, then the dyn algorithm is the best choice.