arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.03241cs.DMmath.CO
收藏

有向图的DAG-宽度和周长

DAG-width and circumference of digraphs

Jørgen Bang-Jensen, Tilde My Larsen

摘要:

证明了圆周的有向图$l$的DAG-宽度至多为$l$,并且这是最佳可能的.作为我们的结果的结果,我们推出的$k$ -链接问题是多项式可解的任何固定的$k$有界周长的有向图类。这回答了\cite{bangTCS562}中提出的一个问题。我们还证明了弱$k$ -链接问题(我们要求弧不相交的道路)是多项式可解的每一个固定的$k$在类的有向图周长为2,以及有界数量的不相交的周期,每个长度至少为3的有向图。有界圆周有向图的情形是开放的。最后证明了DAG宽度不超过5的有向图的最小生成强子图问题是NP-困难的。

英文摘要:

We prove that every digraph of circumference $l$ has DAG-width at most $l$ and this is best possible. As a consequence of our result we deduce that the $k$-linkage problem is polynomially solvable for every fixed $k$ in the class of digraphs with bounded circumference. This answers a question posed in \cite{bangTCS562}. We also prove that the weak $k$-linkage problem (where we ask for arc-disjoint paths) is polynomially solvable for every fixed $k$ in the class of digraphs with circumference 2 as well as for digraphs with a bounded number of disjoint cycles each of length at least 3. The case of bounded circumference digraphs is open. Finally we prove that the minimum spanning strong subdigraph problem is NP-hard on digraphs of DAG-width at most 5.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑