Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees   We present an algorithm for computing a maximum agreement subtree of two
unrooted evolutionary trees. It takes O(n^{1.5} log n) time for trees with
unbounded degrees, matching the best known time complexity for the rooted case.
Our algorithm allows the input trees to be mixed trees, i.e., trees that may
contain directed and undirected edges at the same time. Our algorithm adopts a
recursive strategy exploiting a technique called label compression. The
backbone of this technique is an algorithm that computes the maximum weight
matchings over many subgraphs of a bipartite graph as fast as it takes to
compute a single matching.

27
The categories of this paper are: comp-gas
37
The categories of this paper are: supr-con
14
The categories of this paper are: math-ph
9
The categories of this paper are: nlin
7
The categories of this paper are: hep-th
20
The categories of this paper are: acc-phys
12
The categories of this paper are: nucl-th
5
The categories of this paper are: gr-qc
24
The categories of this paper are: dg-ga
10
The categories of this paper are: q-bio
4
The categories of this paper are: cond-mat
35
The categories of this paper are: mtrl-th
32
The categories of this paper are: atom-ph
2
The categories of this paper are: math
30
The categories of this paper are: q-alg
28
The categories of this paper are: alg-geom