arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.12286cs.DS
收藏

1-平面图边的有效划分

Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest

Sam Barr, Therese Biedl

摘要:

1-平面图是可以在平面中绘制的图,使得任何边与至多一个其它边相交。阿克曼证明了1-平面图的边可以划分为平面图和森林,并声称该证明导致了线性时间算法。然而,目前尚不清楚如何从他的证明中获得这样的算法。在本文中,我们首先reprove阿克曼的结果(事实上,我们证明了一个稍微更一般的声明),然后表明,分裂可以发现在线性时间使用边收缩数据结构由Holm等人。

英文摘要:

1-planar graphs are graphs that can be drawn in the plane such that any edge intersects with at most one other edge. Ackerman showed that the edges of a 1-planar graph can be partitioned into a planar graph and a forest, and claims that the proof leads to a linear time algorithm. However, it is not clear how one would obtain such an algorithm from his proof. In this paper, we first reprove Ackerman's result (in fact, we prove a slightly more general statement) and then show that the split can be found in linear time by using an edge-contraction data structure by Holm et al.

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

↑