Multi-Threading a State-of-the-Art Maximum Clique Algorithm
Ciaran McCreesh, Patrick Prosser · Algorithms · 2013
We present a threaded parallel adaptation of a state-of-the-art maximum clique algorithm for dense, computationally challenging graphs. We show that near-linear speedups are achievable in practice and that superlinear speedups are common. We include results for several previously unsolved benchmark problems.