Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Backtracking-Based Algorithm for Computing Hypertree-Decompositions   Hypertree decompositions of hypergraphs are a generalization of tree
decompositions of graphs. The corresponding hypertree-width is a measure for
the cyclicity and therefore tractability of the encoded computation problem.
Many NP-hard decision and computation problems are known to be tractable on
instances whose structure corresponds to hypergraphs of bounded
hypertree-width. Intuitively, the smaller the hypertree-width, the faster the
computation problem can be solved. In this paper, we present the new
backtracking-based algorithm det-k-decomp for computing hypertree
decompositions of small width. Our benchmark evaluations have shown that
det-k-decomp significantly outperforms opt-k-decomp, the only exact hypertree
decomposition algorithm so far. Even compared to the best heuristic algorithm,
we obtained competitive results as long as the hypergraphs are not too large.

12
The categories of this paper are: nucl-th
37
The categories of this paper are: supr-con
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
2
The categories of this paper are: math
32
The categories of this paper are: atom-ph
10
The categories of this paper are: q-bio
3
The categories of this paper are: physics
8
The categories of this paper are: hep-ex
23
The categories of this paper are: solv-int
21
The categories of this paper are: adap-org
15
The categories of this paper are: nucl-ex
27
The categories of this paper are: comp-gas
30
The categories of this paper are: q-alg
9
The categories of this paper are: nlin