A parallel branch and bound algorithm for the maximum labelled clique problem

McCreesh, C. and Prosser, P. (2015) A parallel branch and bound algorithm for the maximum labelled clique problem. Optimization Letters, 9(5), pp. 949-960. (doi:10.1007/s11590-014-0837-4)

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

244kB

Abstract

The maximum labelled clique problem is a variant of the maximum clique problem where edges in the graph are given labels, and we are not allowed to use more than a certain number of distinct labels in a solution. We introduce a new branch-and-bound algorithm for the problem, and explain how it may be parallelised. We evaluate an implementation on a set of benchmark instances, and show that it is consistently faster than previously published results, sometimes by four or five orders of magnitude.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Mccreesh, Dr Ciaran and Prosser, Dr Patrick
Authors: McCreesh, C., and Prosser, P.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Optimization Letters
Publisher:Springer Berlin Heidelberg
ISSN:1862-4472
ISSN (Online):1862-4480
Copyright Holders:Copyright © 2014 The Authors
First Published:First published in Organization Letters 9(5):949-960
Publisher Policy:Reproduced under a Creative Commons License

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

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
608951Engineering and Physical Sciences Doctoral Training Grant 2012-16Mary Beth KneafseyEngineering & Physical Sciences Research Council (EPSRC)EP/K503058/1VICE PRINCIPAL RESEARCH & ENTERPRISE