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

具有负边权的H-Minor自由图的快速最短路算法

Faster Shortest Path Algorithm for H-Minor Free Graphs with Negative Edge Weights

Christian Wulff-Nilsen

摘要:

设$H$是一个固定图,$G$是一个$H$ -minor free $n$ -顶点图,它具有整数边权,且从给定的点$s$起没有负权圈可达.我们提出了一个算法,计算最短路径树在$G$扎根于$s$在$\tilde{O}(n^{4/3}\log L)$时间,其中$L$是最小的边权重的绝对值。先前的最佳界限是$\tilde{O}(n^{\sqrt{11.5}-2}\log L) = O(n^{1.392}\log L)$。我们的运行时间相匹配的平面图的Henzinger等人的早期绑定。

英文摘要:

Let $H$ be a fixed graph and let $G$ be an $H$-minor free $n$-vertex graph with integer edge weights and no negative weight cycles reachable from a given vertex $s$. We present an algorithm that computes a shortest path tree in $G$ rooted at $s$ in $\tilde{O}(n^{4/3}\log L)$ time, where $L$ is the absolute value of the smallest edge weight. The previous best bound was $\tilde{O}(n^{\sqrt{11.5}-2}\log L) = O(n^{1.392}\log L)$. Our running time matches an earlier bound for planar graphs by Henzinger et al.

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

↑