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

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...

Full description

Bibliographic Details
Main Authors: Patrick Prosser, Ciaran McCreesh
Format: Article
Language:English
Published: MDPI AG 2013-10-01
Series:Algorithms
Subjects:
Online Access:http://www.mdpi.com/1999-4893/6/4/618
id doaj-a482cf5aa1a941559db4d3a65f09e4fe
record_format Article
spelling doaj-a482cf5aa1a941559db4d3a65f09e4fe2020-11-24T21:39:30ZengMDPI AGAlgorithms1999-48932013-10-016461863510.3390/a6040618Multi-Threading a State-of-the-Art Maximum Clique AlgorithmPatrick ProsserCiaran McCreeshWe 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.http://www.mdpi.com/1999-4893/6/4/618maximum cliquemulti-coreparallel algorithmsparallel branch and bound
collection DOAJ
language English
format Article
sources DOAJ
author Patrick Prosser
Ciaran McCreesh
spellingShingle Patrick Prosser
Ciaran McCreesh
Multi-Threading a State-of-the-Art Maximum Clique Algorithm
Algorithms
maximum clique
multi-core
parallel algorithms
parallel branch and bound
author_facet Patrick Prosser
Ciaran McCreesh
author_sort Patrick Prosser
title Multi-Threading a State-of-the-Art Maximum Clique Algorithm
title_short Multi-Threading a State-of-the-Art Maximum Clique Algorithm
title_full Multi-Threading a State-of-the-Art Maximum Clique Algorithm
title_fullStr Multi-Threading a State-of-the-Art Maximum Clique Algorithm
title_full_unstemmed Multi-Threading a State-of-the-Art Maximum Clique Algorithm
title_sort multi-threading a state-of-the-art maximum clique algorithm
publisher MDPI AG
series Algorithms
issn 1999-4893
publishDate 2013-10-01
description 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.
topic maximum clique
multi-core
parallel algorithms
parallel branch and bound
url http://www.mdpi.com/1999-4893/6/4/618
work_keys_str_mv AT patrickprosser multithreadingastateoftheartmaximumcliquealgorithm
AT ciaranmccreesh multithreadingastateoftheartmaximumcliquealgorithm
_version_ 1725930953223700480