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

McCreesh, C. and Prosser, P. (2013) Multi-threading a state-of-the-art maximum clique algorithm. Algorithms, 6(4), pp. 618-635. (doi:10.3390/a6040618)

[img]
Preview
Text
86452.pdf - Published Version
Available under License Creative Commons Attribution.

323kB

Publisher's URL: http://dx.doi.org/10.3390/a6040618

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.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Prosser, Dr Patrick and Mccreesh, Dr Ciaran
Authors: McCreesh, C., and Prosser, P.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Algorithms
Publisher:MDPI
ISSN:1999-4893
Copyright Holders:Copyright © 2013 The Authors
First Published:First published in Algorithms 6(4):618-635
Publisher Policy:Reproduced under a Creative Commons License
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record