# Compact oracles for reachability and approximate distances in planar digraphs

@article{Thorup2004CompactOF, title={Compact oracles for reachability and approximate distances in planar digraphs}, author={M. Thorup}, journal={J. ACM}, year={2004}, volume={51}, pages={993-1024} }

It is shown that a planar digraph can be preprocessed in near-linear time, producing a near-linear space 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 give a near-linear space approximate distances oracle for a weighted planar digraph. With weights drawn from {0, …, N}, it approximates… Expand

#### 265 Citations

Planar Reachability Under Single Vertex or Edge Failures

- Computer Science
- SODA
- 2021

Oracles for bounded-length shortest paths in planar graphs

- Mathematics, Computer Science
- TALG
- 2006

Single source distance oracle for planar digraphs avoiding a failed node or link

- Computer Science, Mathematics
- SODA
- 2012

More Compact Oracles for Approximate Distances in Undirected Planar Graphs

- Computer Science, Mathematics
- SODA
- 2013

Computational study on a branch decomposition based exact distance oracle for planar graphs

- Computer Science
- 2017

Efficient Vertex-Label Distance Oracles for Planar Graphs

- Mathematics, Computer Science
- Theory of Computing Systems
- 2017