Next Article in Journal
Sublinear Time Motif Discovery from Multiple Sequences
Next Article in Special Issue
New Parallel Sparse Direct Solvers for Multicore Architectures
Previous Article in Journal
Local Search Approaches in Stable Matching Problems
Algorithms 2013, 6(4), 618-635; doi:10.3390/a6040618

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

*  and
School of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK
* Author to whom correspondence should be addressed.
Received: 15 August 2013 / Revised: 13 September 2013 / Accepted: 18 September 2013 / Published: 3 October 2013
(This article belongs to the Special Issue Algorithms for Multi Core Parallel Computation)
View Full-Text   |   Download PDF [244 KB, uploaded 3 October 2013]   |   Browse Figures


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 maximum clique; multi-core; parallel algorithms; parallel branch and bound
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
MDPI and ACS Style

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

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here


[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert