Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Optimal Longest Paths by Dynamic Programming   We propose an optimal algorithm for solving the longest path problem in
undirected weighted graphs. By using graph partitioning and dynamic
programming, we obtain an algorithm that is significantly faster than other
state-of-the-art methods. This enables us to solve instances that have
previously been unsolved.

25
The categories of this paper are: patt-sol
22
The categories of this paper are: chao-dyn
28
The categories of this paper are: alg-geom
17
The categories of this paper are: q-fin
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
0
The categories of this paper are: hep-ph
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat
21
The categories of this paper are: adap-org
19
The categories of this paper are: eess
32
The categories of this paper are: atom-ph
8
The categories of this paper are: hep-ex
31
The categories of this paper are: ao-sci
29
The categories of this paper are: funct-an