Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm

Authors:
Philip N. Klein;Shay Mozes;Oren Weimann
Affiliations:
Brown University, Providence RI;Brown University, Providence RI;Massachusetts Institute of Technology, Cambridge, MA
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2010

Citing 15
Cited 13

Finding small simple cycle separators for 2-connected planar graphs

Journal of Computer and System Sciences
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Faster scaling algorithms for network problems

SIAM Journal on Computing
An almost linear time algorithm for generalized matrix searching

SIAM Journal on Discrete Mathematics
Applications of generalized matrix searching to geometric algorithms

Discrete Applied Mathematics - Computational combinatiorics
Scaling Algorithms for the Shortest Paths Problem

SIAM Journal on Computing
Flow in Planar Graphs with Multiple Sources and Sinks

SIAM Journal on Computing
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
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
Globally Optimal Regions and Boundaries as Minimum Ratio Weight Cycles

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Stereo Correspondence with Compact Windows via Minimum Ratio Cycle

IEEE Transactions on Pattern Analysis and Machine Intelligence
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
"Ratio Regions": A Technique for Image Segmentation

ICPR '96 Proceedings of the 13th International Conference on Pattern Recognition - Volume 2
A near-linear time algorithm for computing replacement paths in planar directed graphs

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

Finding shortest non-trivial cycles in directed graphs on surfaces

Proceedings of the twenty-sixth annual symposium on Computational geometry
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
Single source distance oracle for planar digraphs avoiding a failed node or link

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
Shortest path and distance queries on road networks: an experimental evaluation

Proceedings of the VLDB Endowment
Computing all-pairs shortest paths by leveraging low treewidth

Journal of Artificial Intelligence Research
Counting and sampling minimum cuts in genus g graphs

Proceedings of the twenty-ninth annual symposium on Computational geometry
Shortest path and distance queries on road networks: towards bridging theory and practice

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
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
Shortest-path queries in static networks

ACM Computing Surveys (CSUR)
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an O(n log2 n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes.