Faster Shortest Paths in Dense Distance Graphs, with Applications.
Theoretical Computer Science(2018)
摘要
We show how to combine two techniques for efficiently computing shortest paths in directed planar graphs. The first is the linear-time shortest-path algorithm of Henzinger, Klein, Subramanian, and Rao [STOC'94]. The second is Fakcharoenphol and Rao's algorithm [FOCS'01] for emulating Dijkstra's algorithm on the dense distance graph (DDG). A DDG is defined for a decomposition of a planar graph G into regions of at most r vertices each, for some parameter r更多
查看译文
关键词
Planar graphs,Shortest paths,Recursive r-divisions,Dynamic range minimum queries,Monge heaps
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要