Open AccessThis article is
- freely available
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; in revised form: 13 September 2013 / Accepted: 18 September 2013 / Published: 3 October 2013
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
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
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.
McCreesh C, Prosser P. Multi-Threading a State-of-the-Art Maximum Clique Algorithm. Algorithms. 2013; 6(4):618-635.
McCreesh, Ciaran; Prosser, Patrick. 2013. "Multi-Threading a State-of-the-Art Maximum Clique Algorithm." Algorithms 6, no. 4: 618-635.