一个有效的基于分隔子部分填充的树宽上界
An Effective Upperbound on Treewidth Using Partial Fill-in of Separators
摘要:
使用图分离器(特别是团分离器)来划分图是将图分解成可以独立处理的更小单元的公知技术。以前已知树宽由分隔符的大小加上不相交分量的树宽之和来界定,这是通过填充分隔符的所有边缘使其成为团的启发式方法获得的。在本文中,我们提出了一个新的,更严格的上界的树宽度的图得到的部分填充的边缘的分离器。特别地,该方法仅完成与公共组件相邻的那些分隔符顶点对,并且指示比填充整个分隔符更有效的启发式。我们讨论的相关性,这一结果的组合算法,并给出了一个例子,如何更紧密的界可以利用域的约束满足问题。
英文摘要:
Partitioning a graph using graph separators, and particularly clique separators, are well-known techniques to decompose a graph into smaller units which can be treated independently. It was previously known that the treewidth was bounded above by the sum of the size of the separator plus the treewidth of disjoint components, and this was obtained by the heuristic of filling in all edges of the separator making it into a clique. In this paper, we present a new, tighter upper bound on the treewidth of a graph obtained by only partially filling in the edges of a separator. In particular, the method completes just those pairs of separator vertices that are adjacent to a common component, and indicates a more effective heuristic than filling in the entire separator. We discuss the relevance of this result for combinatorial algorithms and give an example of how the tighter bound can be exploited in the domain of constraint satisfaction problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。