Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
A data structure for dynamic trees
Journal of Computer and System Sciences
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Bounded ordered dictionaries in O(loglogN) time and O(n) space
Information Processing Letters
Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
Maintenance of a minimum spanning forest in a dynamic plane graph
Journal of Algorithms
The lattice structure of flow in planar graphs
SIAM Journal on Discrete Mathematics
Using cellular graph embeddings in solving all pairs shortest paths problems
Journal of Algorithms
The Vertex-Disjoint Menger Problem in Planar Graphs
SIAM Journal on Computing
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
SIAM Journal on Computing
Maximum (s,t)-flows in planar networks in O(|V| log |V|) time
Journal of Computer and System Sciences
Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
An O (n log n) algorithm for maximum st-flow in a directed planar graph
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A near-linear time algorithm for computing replacement paths in planar directed graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Journal of Experimental Algorithmics (JEA)
ACM Transactions on Algorithms (TALG)
Engineering fast route planning algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A near-linear-time algorithm for computing replacement paths in planar directed graphs
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
Lattices and maximum flow algorithms in planar graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
The tight orthogonal homotopic bases of closed oriented triangulated surfaces and their computing
Computers & Mathematics with Applications
Improved algorithms for min cut and max flow in undirected planar graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Shortest non-trivial cycles in directed surface graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
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
Improved distance queries in planar graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Min-cuts and shortest cycles in planar graphs in O(n log log n) time
ESA'11 Proceedings of the 19th European conference on Algorithms
SIAM Journal on Discrete Mathematics
Tightening Nonsimple Paths and Cycles on Surfaces
SIAM Journal on Computing
Delineating imprecise regions via shortest-path graphs
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
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
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
Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Minimum cuts and shortest non-separating cycles via homology covers
Proceedings of the twenty-second 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
Counting and sampling minimum cuts in genus g graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
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
Approximating the diameter of planar graphs in near linear time
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Given an n-node planar graph with nonnegative edge-lengths, our algorithm takes O(n log n) time to construct a data structure that supports queries of the following form in O(log n) time: given a destination node t on the boundary of the infinite face, and given a start node s anywhere, find the s-to-t distance.