Algorithms 2013, 6(4), 618-635; doi:10.3390/a6040618

Multi-Threading a State-of-the-Art Maximum Clique Algorithm

* email and email
Received: 15 August 2013; in revised form: 13 September 2013 / Accepted: 18 September 2013 / Published: 3 October 2013
(This article belongs to the Special Issue Algorithms for Multi Core Parallel Computation)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
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.
Keywords: maximum clique; multi-core; parallel algorithms; parallel branch and bound
PDF Full-text Download PDF Full-Text [244 KB, uploaded 3 October 2013 13:32 CEST]

Export to BibTeX |

MDPI and ACS Style

McCreesh, C.; Prosser, P. Multi-Threading a State-of-the-Art Maximum Clique Algorithm. Algorithms 2013, 6, 618-635.

AMA Style

McCreesh C, Prosser P. Multi-Threading a State-of-the-Art Maximum Clique Algorithm. Algorithms. 2013; 6(4):618-635.

Chicago/Turabian Style

McCreesh, Ciaran; Prosser, Patrick. 2013. "Multi-Threading a State-of-the-Art Maximum Clique Algorithm." Algorithms 6, no. 4: 618-635.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert