一个快速求近最优连接树的算法
A Sufficiently Fast Algorithm for Finding Close to Optimal Junction Trees
摘要：
给出了一个求给定图G的近最优连接树的算法。该算法的最坏情况复杂度为O（c^k n^a），其中a和c是常数，n是顶点数，k是G的联合树中最大团的大小，其中最大团的大小被最小化。该算法保证所产生的联合树中最重团的状态空间大小的对数小于最优值的常数因子。当k = O（log n）时，我们的算法给出了贝叶斯网络的多项式推理算法.
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
