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

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

0.00 Avg rating0 Votes
Article ID: iaor201526252
Volume: 9
Issue: 5
Start Page Number: 949
End Page Number: 960
Publication Date: Jun 2015
Journal: Optimization Letters
Authors: ,
Keywords: programming: branch and bound
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.

Reviews

Required fields are marked *. Your email address will not be published.