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
Article Menu

Export Article

Open AccessArticle
Algorithms 2013, 6(4), 618-635;

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

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)
Full-Text   |   PDF [244 KB, uploaded 3 October 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. View Full-Text
Keywords: maximum clique; multi-core; parallel algorithms; parallel branch and bound maximum clique; multi-core; parallel algorithms; parallel branch and bound

Figure 1

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

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

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



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