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

欧几里得图类中的线性时间单源最短路径算法

Linear time single-source shortest path algorithms in Euclidean graph classes

The University of Sydney(悉尼大学);The University of Copenhagen(哥本哈根大学)

Joachim Gudmundsson, Yuan Sha, Sampson Wong

AI总结:

本文研究了欧几里得图类中线性时间单源最短路径算法的存在条件,证明满足特定条件的图类可支持此类算法,并展示了收缩图具有子线性分离性。

摘要:

在Henzinger等人1997年的著名论文中,证明了平面图具有线性时间单源最短路径算法。然而,该算法无法扩展到欧几里得图类。本文给出了准则,并证明任何满足准则的欧几里得图类都支持线性时间单源最短路径算法。作为主要成分,我们展示了这些欧几里得图类的收缩图具有子线性分离性。

英文摘要:

In the celebrated paper of Henzinger, Klein, Rao and Subramanian (1997), it was shown that planar graphs admit a linear time single-source shortest path algorithm. Their algorithm unfortunately does not extend to Euclidean graph classes. We give criteria and prove that any Euclidean graph class satisfying the criteria admits a linear time single-source shortest path algorithm. As a main ingredient, we show that the contracted graphs of these Euclidean graph classes admit sublinear separators.

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

↑