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

平面生成树间最短翻转序列的结构特性

Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees

Graz University of Technology(格拉茨工业大学);TU Braunschweig(布伦瑞克工业大学);University of Kassel(卡塞尔大学)

Oswin Aichholzer, Joseph Dorfer, Peter Kramer, Christian Rieck, Birgit Vogtenhuber

AI总结:

研究平面生成树间最短翻转序列的结构特性,探讨喜悦边、停车场边及停车场猜想的成立情况与推翻。

摘要:

我们研究了平面生成树在平面凸位置点集上的重新配置,其中重新配置步骤(翻转)用一条边替换另一条边,从而再次得到一个平面生成树。两个树之间的翻转距离是将一个树转换为另一个树所需的最少翻转次数。我们研究最短翻转序列的结构特性。 folklore 喜悦边猜想建议,任何初始和目标树共有的边在最短翻转序列中永远不会被翻转。更近期的停车场边猜想,如果成立将推导出喜悦边猜想,指出存在仅使用起始和目标树边以及点集凸包中边的最短翻转序列。另一个隐含在文献中的猜想是停车场猜想,指出没有边会被翻转超过两次。几乎所有最近的翻转算法都尊重这三个猜想及其所推导出的性质。我们研究了后者两个猜想成立的情况,并在一般情况下推翻了它们。 (由于arXiv限制,摘要已缩短。)

英文摘要:

We study the reconfiguration of plane spanning trees on point sets in the plane in convex position, where a reconfiguration step (flip) replaces one edge with another, yielding again a plane spanning tree. The flip distance between two trees is then the minimum number of flips needed to transform one tree into the other. We study structural properties of shortest flip sequences. The folklore happy edge conjecture suggests that any edge shared by both the initial and target tree is never flipped in a shortest flip sequence. The more recent parking edge conjecture, which would have implied the happy edge conjecture, states that there exist shortest flip sequences which use only edges of the start and target tree, and edges in the convex hull of the point set. Finally, another conjecture that is implicit in the literature is the reparking conjecture which states that no edge is flipped more than twice. Essentially all recent flip algorithms respect these three conjectures and the properties they imply. We study cases in which the latter two conjectures hold and disprove them for the general setting. (Shortened abstract due to arXiv restrictions.)

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

↑