动态规划在上界树宽中的启发式应用
A heuristic use of dynamic programming to upperbound treewidth
摘要:
对于图$G$,令$Π(G)$表示$G$的所有潜在最大团的集合。对于$Π(G)$的每个子集$Π$,令$\tw(G, Π)$表示最小的$k$,使得存在宽度为$k$的$G$的树分解,其袋都属于$Π$。Bouchitté和Todinca在2001年观察到$\tw(G, Π(G))$正好是$G$的树宽,并开发了一个动态规划算法来计算它。事实上,他们的算法可以很容易地应用于$Π(G)$的任意非空子集$Π$,并计算$\tw(G, Π)$,或者报告它是未定义的,在时间$|Π||V(G)|^{O(1)}$。这种有效的工具,用于计算$\tw(G, Π)$,使我们能够设想一个迭代的改进过程树宽上界保持,作为当前的解决方案,一组潜在的最大集团,而不是树分解。我们设计并实现了一个算法沿着这种方法。实验表明,我们的算法大大优于以前实现的启发式算法的树宽。
英文摘要:
For a graph $G$, let $Π(G)$ denote the set of all potential maximal cliques of $G$. For each subset $Π$ of $Π(G)$, let $\tw(G, Π)$ denote the smallest $k$ such that there is a tree-decomposition of $G$ of width $k$ whose bags all belong to $Π$. Bouchitté and Todinca observed in 2001 that $\tw(G, Π(G))$ is exactly the treewidth of $G$ and developed a dynamic programming algorithm to compute it. Indeed, their algorithm can readily be applied to an arbitrary non-empty subset $Π$ of $Π(G)$ and computes $\tw(G, Π)$, or reports that it is undefined, in time $|Π||V(G)|^{O(1)}$. This efficient tool for computing $\tw(G, Π)$ allows us to conceive of an iterative improvement procedure for treewidth upper bounds which maintains, as the current solution, a set of potential maximal cliques rather than a tree-decomposition. We design and implement an algorithm along this approach. Experiments show that our algorithm vastly outperforms previously implemented heuristic algorithms for treewidth.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。