%0 Journal Article
%T Multi-Threading a State-of-the-Art Maximum Clique Algorithm
%A Ciaran McCreesh
%A Patrick Prosser
%J Algorithms
%D 2013
%I MDPI AG
%R 10.3390/a6040618
%X 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.
%K maximum clique
%K multi-core
%K parallel algorithms
%K parallel branch and bound
%U http://www.mdpi.com/1999-4893/6/4/618