包上带度量约束的树和路分解的计算
On computing tree and path decompositions with metric constraints on the bags
摘要:
本文研究了计算任意图$G$的\emph{tree-length}和\emph{tree-breadth}的复杂性,它们分别是$G$的树分解中袋的直径和半径的最佳可能上界. \emph{Path-length}和\emph{path-breadth}被类似地定义和研究用于路径分解。到目前为止,已经知道树长是NP难计算的。本文证明了树宽、路长和路宽也是如此。此外,我们提供了一个更详细的分析计算树宽度的复杂性。特别是,我们表明,树宽度1的图在某种意义上是最难的情况下计算树宽度的问题。给出了树宽图的新性质。然后,我们使用这些属性,以识别在多项式时间的所有图与树宽一个是平面或二分图。在此过程中,我们将树宽度与\emph{$k$-good}树分解(用于$k=1$)的概念联系起来,这在以前的路由工作中已经引入。作为上述关系的一个副产品,我们证明,决定存在的$k$ -好树分解是NP-完全的(即使$k=1$)。所有这些都回答了文献中的开放性问题。
英文摘要:
We here investigate on the complexity of computing the \emph{tree-length} and the \emph{tree-breadth} of any graph $G$, that are respectively the best possible upper-bounds on the diameter and the radius of the bags in a tree decomposition of $G$. \emph{Path-length} and \emph{path-breadth} are similarly defined and studied for path decompositions. So far, it was already known that tree-length is NP-hard to compute. We here prove it is also the case for tree-breadth, path-length and path-breadth. Furthermore, we provide a more detailed analysis on the complexity of computing the tree-breadth. In particular, we show that graphs with tree-breadth one are in some sense the hardest instances for the problem of computing the tree-breadth. We give new properties of graphs with tree-breadth one. Then we use these properties in order to recognize in polynomial-time all graphs with tree-breadth one that are planar or bipartite graphs. On the way, we relate tree-breadth with the notion of \emph{$k$-good} tree decompositions (for $k=1$), that have been introduced in former work for routing. As a byproduct of the above relation, we prove that deciding on the existence of a $k$-good tree decomposition is NP-complete (even if $k=1$). All this answers open questions from the literature.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。