Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Preprocessing an undirected planar network to enable fast approximate distance queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sparse distance preservers and additive spanners
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
An Additive Stretched Routing Scheme for Chordal Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Well-separated pair decomposition for the unit-disk graph metric and its applications
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Journal of the ACM (JACM)
Multiple-source shortest paths in planar graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Optimal-stretch name-independent compact routing in doubling metrics
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Oracles for bounded-length shortest paths in planar graphs
ACM Transactions on Algorithms (TALG)
Interval routing in reliability networks
Theoretical Computer Science - Foundations of software science and computation structures
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Point-to-Point Shortest Path Algorithms with Preprocessing
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Labeling schemes for weighted dynamic trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Engineering fast route planning algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Localized and compact data-structure for comparability graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Planar graphs, via well-orderly maps and trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Compact and low delay routing labeling scheme for Unit Disk Graphs
Computational Geometry: Theory and Applications
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Engineering highway hierarchies
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
It is shown that a planar digraph can be preprocessed in near-linear time, producing a near-linear space distance oracle that can answer reachability queries in constant time. The oracle can be distributed as an O(log n) space label for each vertex and then we can determine if one vertex can reach another considering their two labels only.The approach generalizes to approximate distances in weighted planar digraphs where we can then get a (1 + \varepsilon ) approximation distance in 0(\log \log \Delta+ {1 \mathord{\left/ {\vphantom {1 \varepsilon }} \right. \kern-\nulldelimiterspace} \varepsilon }) time where \Delta is the longest finite distance in the graph and weights are assumed to be non-negative integers. Our scheme can be extended to find and route along the short dipaths.Our technique is based on a novel dipath decomposition of planar digraphs that instead of using the standard separator with 0(\sqrt n ) vertices, in effect finds a separator using a constant number of dipaths.