Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
The Vertex-Disjoint Menger Problem in Planar Graphs
SIAM Journal on Computing
Edge-disjoint (s,t)-paths in undirected planar graphs in linear time
Journal of Algorithms
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
Many distances in planar graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A subset spanner for Planar graphs,: with application to subset TSP
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Planar graphs, negative weight edges, shortest paths, and near linear time
Journal of Computer and System Sciences - Special issue on FOCS 2001
Multiple source shortest paths in a genus g graph
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
ACM Transactions on Algorithms (TALG)
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
Improved algorithms for min cut and max flow in undirected planar graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Maximum Flow in Directed Planar Graphs with Vertex Capacities
Algorithmica - Special Issue: European Symposium on Algorithms, Design and Analysis
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
Computing the girth of a planar graph in linear time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Multiple-source single-sink maximum flow in directed planar graphs in O(diameter ċ n log n) time
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Exact distance oracles for planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Computing replacement paths in surface embedded graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Single Source -- All Sinks Max Flows in Planar Digraphs
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We give simple linear-time algorithms for two problems in planar graphs: max st-flow in directed graphs with unit capacities, and multiple-source shortest paths in undirected graphs with unit lengths.