Multi-threading a state-of-the-art maximum clique algorithm

Abstract

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 © 2013 by the authors; licensee MDPI, Basel, Switzerland. © 2013 by the authors; licensee MDPI, Basel, Switzerland.