Abstract
Given an n-vertex planar directed graph with real edge lengths and with no negative cycles, we show how to compute single-source shortest path distances in the graph in O(nlog2 n/loglogn) time with O(n) space. This improves on a recent O(nlog2 n) time bound by Klein et al.
Chapter PDF
Similar content being viewed by others
References
Chambers, E.W., Erickson, J., Nayyeri, A.: Homology flows, cohomology cuts. In: Proc. 42nd Ann. ACM Symp. Theory Comput., pp. 273–282 (2009)
Erickson, J.: Private Communication (2010)
Fakcharoenphol, J., Rao, S.: Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. 72(5), 868–889 (2006)
Henzinger, M.R., Klein, P.N., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55(1), 3–23 (1997)
Klawe, M.M., Kleitman, D.J.: An almost linear time algorithm for generalized matrix searching. SIAM Journal on Discrete Math. 3(1), 81–97 (1990)
Klein, P.N.: Multiple-source shortest paths in planar graphs. In: Proceedings, 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 146–155 (2005)
Klein, P.N., Mozes, S., Weimann, O.: Shortest Paths in Directed Planar Graphs with Negative Lengths: a Linear-Space O(nlog2n)-Time Algorithm. In: Proc. 19th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 236–245 (2009)
Lipton, R.J., Rose, D.J., Tarjan, R.E.: Generalized nested dissection. SIAM Journal on Numerical Analysis 16, 346–358 (1979)
Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. J. Comput. Syst. Sci. 32, 265–279 (1986)
Aggarwal, A., Klawe, M., Moran, S., Shor, P.W., Wilber, R.: Geometric applications of a matrix searching algorithm. In: SCG 1986: Proceedings of the second annual symposium on Computational geometry, pp. 285–292 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mozes, S., Wulff-Nilsen, C. (2010). Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time. In: de Berg, M., Meyer, U. (eds) Algorithms – ESA 2010. ESA 2010. Lecture Notes in Computer Science, vol 6347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15781-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-15781-3_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15780-6
Online ISBN: 978-3-642-15781-3
eBook Packages: Computer ScienceComputer Science (R0)