Compact oracles for reachability and approximate distances in planar digraphs

  title={Compact oracles for reachability and approximate distances in planar digraphs},
  author={M. Thorup},
  journal={J. ACM},
  • M. Thorup
  • Published 2004
  • Mathematics, Computer Science
  • J. ACM
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
Planar Reachability Under Single Vertex or Edge Failures
Single source distance oracle for planar digraphs avoiding a failed node or link
Computational study on a branch decomposition based exact distance oracle for planar graphs
Efficient Vertex-Label Distance Oracles for Planar Graphs