Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Testing isomorphism of chordal graphs of bounded leafage is
  fixed-parameter tractable   The computational complexity of the graph isomorphism problem is considered
to be a major open problem in theoretical computer science. It is known that
testing isomorphism of chordal graphs is polynomial-time equivalent to the
general graph isomorphism problem. Every chordal graph can be represented as
the intersection graph of some subtrees of a representing tree, and the leafage
of a chordal graph is defined to be the minimum number of leaves in a
representing tree for it. We prove that chordal graph isomorphism is fixed
parameter tractable with leafage as parameter. In the process we introduce the
problem of isomorphism testing for higher-order hypergraphs and show that
finding the automorphism group of order-$k$ hypergraphs with vertex color
classes of size $b$ is fixed parameter tractable for any constant $k$ and $b$
as fixed parameter.

34
The categories of this paper are: chem-ph
16
The categories of this paper are: stat
9
The categories of this paper are: nlin
11
The categories of this paper are: hep-lat
25
The categories of this paper are: patt-sol
15
The categories of this paper are: nucl-ex
7
The categories of this paper are: hep-th
3
The categories of this paper are: physics
27
The categories of this paper are: comp-gas
14
The categories of this paper are: math-ph
10
The categories of this paper are: q-bio
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
33
The categories of this paper are: plasm-ph
0
The categories of this paper are: hep-ph
13
The categories of this paper are: quant-ph