Shortest paths in planar graphs with real lengths in O(n log2n/ log log n) time

Authors:
Shay Mozes;Christian Wulff-Nilsen
Affiliations:
Department of Computer Science, Brown University, Providence;Department of Computer Science, University of Copenhagen, Copenhagen, Denmark
Venue:
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Year:
2010

Citing 8
Cited 9

Finding small simple cycle separators for 2-connected planar graphs

Journal of Computer and System Sciences
Geometric applications of a matrix searching algorithm

SCG '86 Proceedings of the second annual symposium on Computational geometry
An almost linear time algorithm for generalized matrix searching

SIAM Journal on Discrete Mathematics
Faster shortest-path algorithms for planar graphs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Multiple-source shortest paths in planar graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Planar graphs, negative weight edges, shortest paths, and near linear time

Journal of Computer and System Sciences - Special issue on FOCS 2001
Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2 n)-time algorithm

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Homology flows, cohomology cuts

Proceedings of the forty-first annual ACM symposium on Theory of computing

Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Improved distance queries in planar graphs

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Exact distance oracles for planar graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Global minimum cuts in surface embedded graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Accelerated bend minimization

GD'11 Proceedings of the 19th international conference on Graph Drawing
Counting and sampling minimum cuts in genus g graphs

Proceedings of the twenty-ninth annual symposium on Computational geometry
Structured recursive separator decompositions for planar graphs in linear time

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.