arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2112.06306math.COcs.DM
收藏

在线性时间内计算局部极大1-平面图的vertex connectivity

Computing the vertex connectivity of a locally maximal 1-plane graph in linear time

Therese Biedl, Karthik Murali

摘要:

已知可平面图的点连通度可以在线性时间内计算。我们将这个结果推广到局部极大1-平面图类:具有嵌入的图,每条边至多有一个交叉,使得每对交叉边的端点诱导完全图$K_4$

英文摘要:

It is known that the vertex connectivity of a planar graph can be computed in linear time. We extend this result to the class of locally maximal 1-plane graphs: graphs that have an embedding with at most one crossing per edge such that the endpoints of each pair of crossing edges induce the complete graph $K_4$

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

↑