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

单位圆盘图中的最短路径分隔符

Shortest Path Separators in Unit Disk Graphs

Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng

AI总结:

本文提出单位圆盘图中基于两条最短路径及其1跳邻居的平衡分隔符定理,改进了先前需移除3跳邻域的结果,并利用Delaunay三角剖分及推广的Lipton-Tarjan定理进行证明。

摘要:

我们为涉及两条最短路径及其1跳邻居和另外两个顶点的单位圆盘图引入了一个新的平衡分隔符定理。这回答了Yan、Xiang和Dragan [CGTA '12]的一个开放问题,并改进了他们需要移除两条最短路径的3跳邻域的结果。我们的证明使用了非常不同的思路,包括Delaunay三角剖分以及将Lipton和Tarjan [J. Appl. Math. '79]著名的平衡分隔符定理推广到不相交路径系统。

英文摘要:

We introduce a new balanced separator theorem for unit-disk graphs involving two shortest paths combined with the 1-hop neighbours of those paths and two other vertices. This answers an open problem of Yan, Xiang and Dragan [CGTA '12] and improves their result that requires removing the 3-hop neighborhood of two shortest paths. Our proof uses very different ideas, including Delaunay triangulations and a generalization of the celebrated balanced separator theorem of Lipton and Tarjan [J. Appl. Math. '79] to systems of non-intersecting paths.

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

↑