论文信息 - Shortest Paths in Planar Graphs with Real Lengths in O(nlog2n/loglogn) Time

Shortest Paths in Planar Graphs with Real Lengths in O(nlog2n/loglogn) Time

Given an n-vertex planar directed graphwith real edge lengths and with no negative cycles, we show how to compute single-source shortest path distances in the graph in O(n log2 n/ log log n) time with O(n) space. This improves on a recent O(n log2 n) time bound by Klein et al.

Christian Wulff-Nilsen | Shay Mozes | S. Mozes | Christian Wulff-Nilsen

[1] N. S. Barnett,et al. Private communication , 1969 .

[2] D. Rose,et al. Generalized nested dissection , 1977 .

[3] Gary L. Miller,et al. Finding small simple cycle separators for 2-connected planar graphs. , 1984, STOC '84.

[4] Alok Aggarwal,et al. Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[5] Daniel J. Kleitman,et al. An Almost Linear Time Algorithm for Generalized Matrix Searching , 1990, SIAM J. Discret. Math..

[6] Philip N. Klein,et al. Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[7] Philip N. Klein,et al. Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[8] Philip N. Klein,et al. Multiple-source shortest paths in planar graphs , 2005, SODA '05.

[9] Satish Rao,et al. Planar graphs, negative weight edges, shortest paths, and near linear time , 2006, J. Comput. Syst. Sci..

[10] Erin W. Chambers,et al. Homology flows, cohomology cuts , 2009, STOC '09.

[11] Philip N. Klein,et al. Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm , 2010, TALG.