Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Sufficiently Fast Algorithm for Finding Close to Optimal Junction
  Trees   An algorithm is developed for finding a close to optimal junction tree of a
given graph G. The algorithm has a worst case complexity O(c^k n^a) where a and
c are constants, n is the number of vertices, and k is the size of the largest
clique in a junction tree of G in which this size is minimized. The algorithm
guarantees that the logarithm of the size of the state space of the heaviest
clique in the junction tree produced is less than a constant factor off the
optimal value. When k = O(log n), our algorithm yields a polynomial inference
algorithm for Bayesian networks.

33
The categories of this paper are: plasm-ph
30
The categories of this paper are: q-alg
28
The categories of this paper are: alg-geom
24
The categories of this paper are: dg-ga
10
The categories of this paper are: q-bio
5
The categories of this paper are: gr-qc
3
The categories of this paper are: physics
26
The categories of this paper are: bayes-an
21
The categories of this paper are: adap-org
20
The categories of this paper are: acc-phys
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph
35
The categories of this paper are: mtrl-th
13
The categories of this paper are: quant-ph
6
The categories of this paper are: astro-ph