Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Learning based Branch and Bound for Maximum Common Subgraph Problems   Branch-and-bound (BnB) algorithms are widely used to solve combinatorial
problems, and the performance crucially depends on its branching heuristic.In
this work, we consider a typical problem of maximum common subgraph (MCS), and
propose a branching heuristic inspired from reinforcement learning with a goal
of reaching a tree leaf as early as possible to greatly reduce the search tree
size.Extensive experiments show that our method is beneficial and outperforms
current best BnB algorithm for the MCS.

28
The categories of this paper are: alg-geom
6
The categories of this paper are: astro-ph
13
The categories of this paper are: quant-ph
29
The categories of this paper are: funct-an
25
The categories of this paper are: patt-sol
3
The categories of this paper are: physics
15
The categories of this paper are: nucl-ex
5
The categories of this paper are: gr-qc
7
The categories of this paper are: hep-th
14
The categories of this paper are: math-ph
8
The categories of this paper are: hep-ex
35
The categories of this paper are: mtrl-th
32
The categories of this paper are: atom-ph
20
The categories of this paper are: acc-phys
17
The categories of this paper are: q-fin
10
The categories of this paper are: q-bio