arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2201.04354cs.DScs.DM
收藏

具有度约束和直径约束的生成树重构

Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint

Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa

摘要:

我们调查的复杂性,找到一个变换从一个给定的生成树在一个图中的另一个给定的生成树在同一个图通过一系列的边翻转。拟阵基的交换性质立即产生这样的变换总是存在的,如果我们没有对生成树的约束。在本文中,我们希望找到一个变换,它只通过满足某些约束的生成树。我们的重点是界定最大度或直径的生成树,我们给出了以下结果。最大次数有下界的问题在多项式时间内是可解的,而最大次数有上界的问题是PSPACE-完全的。直径有下界的问题是NP-难的,而直径有上界的问题在多项式时间内是可解的。

英文摘要:

We investigate the complexity of finding a transformation from a given spanning tree in a graph to another given spanning tree in the same graph via a sequence of edge flips. The exchange property of the matroid bases immediately yields that such a transformation always exists if we have no constraints on spanning trees. In this paper, we wish to find a transformation which passes through only spanning trees satisfying some constraint. Our focus is bounding either the maximum degree or the diameter of spanning trees, and we give the following results. The problem with a lower bound on maximum degree is solvable in polynomial time, while the problem with an upper bound on maximum degree is PSPACE-complete. The problem with a lower bound on diameter is NP-hard, while the problem with an upper bound on diameter is solvable in polynomial time.

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

↑