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
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
A near-linear-time algorithm for computing replacement paths in planar directed graphs
ACM Transactions on Algorithms (TALG)
Single source shortest paths in H-minor free graphs
Theoretical Computer Science
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Solving the replacement paths problem for planar directed graphs in O(n log n) time
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Maximum flows and parametric shortest paths in planar graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Shortest paths in planar graphs with real lengths in O(n log2n/ log log n) time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Computing replacement paths in surface embedded graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
GD'11 Proceedings of the 19th international conference on Graph Drawing
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.02 |
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. The best previously known algorithm requires O(n log3 n) time and O(n log n) space.