2014/07/25 by Ciaran McCreesh, McCreesh, Ciaran, Patrick Prosser +1
Computer Science · #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #Social and Information Networks (cs.SI) #and Cluster Computing (cs.DC) #cs.DC #cs.DS #cs.SI
paper · pdf · doi:10.48550/arxiv.1407.7061
Author-final version. Accepted to Optimization Letters
arxiv created 2014/11/17 · arxiv updated 2014/11/18
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.