Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique
  Problem   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.

6
The categories of this paper are: astro-ph
16
The categories of this paper are: stat
25
The categories of this paper are: patt-sol
33
The categories of this paper are: plasm-ph
21
The categories of this paper are: adap-org
18
The categories of this paper are: econ
11
The categories of this paper are: hep-lat
8
The categories of this paper are: hep-ex
14
The categories of this paper are: math-ph
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
9
The categories of this paper are: nlin
36
The categories of this paper are: cmp-lg
12
The categories of this paper are: nucl-th
32
The categories of this paper are: atom-ph
7
The categories of this paper are: hep-th