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}
}
  • 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
Oracles for bounded-length shortest paths in planar graphs
TLDR
A new approach for answering short path queries in planar graphs, motivated by a practical situation where nodes or links of a network may be temporarily out of service, which can be easily generalized to other wide classes of graphs. Expand
Planar Reachability Under Single Vertex or Edge Failures
TLDR
An efficient reachability oracle under single-edge or single-vertex failures for planar directed graphs is presented and new data structures which generalize dominator trees and previous data structures for strong-connectivity under failures are presented. Expand
Single source distance oracle for planar digraphs avoiding a failed node or link
TLDR
The all-pairs version of this problem is addressed and a data structure with O(n ∼n polylog n) preprocessing time and space which guarantees O(√n poly log n) query time is presented. Expand
Reachability Oracles for Disk Transmission Graphs
Let P ⊆ R be a set of n points, each with an associated radius rp > 0. This induces a directed graph on P with an edge from p to q if and only if q lies in the ball with radius rp around p. We showExpand
More Compact Oracles for Approximate Distances in Undirected Planar Graphs
TLDR
The polynomial dependency on e−1 and log n is reduced, getting the first improvement in the query time--space tradeoff, and an oracle with space O(n) and query time O(e−1 is obtained. Expand
Decremental single-source reachability in planar digraphs
TLDR
These results constitute the first almost optimal (up to polylogarithmic factors) algorithms for both directed planar graphs for non-trivial reachability-type problems, for which only polynomial bounds are known in general graphs. Expand
Almost Optimal Distance Oracles for Planar Graphs ∗ Panagiotis Charalampopoulos
We present new tradeoffs between space and query-time for exact distance oracles in directed weighted planar graphs. These tradeoffs are almost optimal in the sense that they are withinExpand
Computational study on a branch decomposition based exact distance oracle for planar graphs
We present a simple exact distance oracle for the point-to-point shortest distance problem in planar graphs. Given an edge weighted planar graph G of n vertices, we decompose G into subgraphs by aExpand
Almost optimal distance oracles for planar graphs
We present new tradeoffs between space and query-time for exact distance oracles in directed weighted planar graphs. These tradeoffs are almost optimal in the sense that they are withinExpand
Efficient Vertex-Label Distance Oracles for Planar Graphs
TLDR
It is shown how to preprocess a directed planar graph with vertex labels and arc lengths into a data structure that answers queries of the following form. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 43 REFERENCES
Dynamic Reachability in Planar Digraphs with One Source and One Sink
TLDR
This paper investigates the reachability problem on spherical st-graphs, which are planar acyclic digraphs with exactly one source and exactly one sink and presents a dynamic data structure, which uses O( n ) space and supports reachability queries and updates in O(log n ) time. Expand
On-Line Algorithms for Shortest Path Problems on Planar Digraphs
TLDR
Efficient algorithms for answering shortest path queries in digraphs with small separators and, in particular, in planarDigraphs are described, for any class ofdigraphs for which an O(√n) separator theorem holds. Expand
Shortcutting Planar Digraphs
  • M. Thorup
  • Mathematics, Computer Science
  • Comb. Probab. Comput.
  • 1995
TLDR
A constructive proof that for any planar digraph G on p vertices, there exists a subset S of the transitive closure of G such that the number of arcs in S is less than or equal to the numberOf arcs in G, and the diameter of G ∪ S is O. Expand
A Fully Dynamic Data Structure for Reachability in Planar Digraphs
TLDR
A fully dynamic O(n)-space data structure is given to support an arbitrary sequence of operations that consist of adding new edges, deleting some existing edge, and querying to find out if a given node v is reachable in G by a directed path from another node u. Expand
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
TLDR
The data structure is based on a recursive separator decomposition of the graph and it encodes the shortest paths between the members of a properly chosen subset of vertices, and is applied to construct improved shortest path algorithms for dynamic planar digraphs. Expand
Computing Shortest Paths and Distances in Planar Graphs
TLDR
Efficient sequential and parallel solutions to the problem of answer on-line queries requesting the shortest distance between any two vertices in G, based on the hammock decomposition of a planar digraph and the use of separators for computing quickly internal distances in the graph. Expand
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
TLDR
The approximation algorithm is based upon a novel technique for approximately representing all-pairs shortest paths among a selected subset of the nodes by a sparse substitute graph, and is guaranteed to be accurate to within a 1+ $\epsilon$ factor. Expand
Sublinear time algorithms for metric space problems
  • P. Indyk
  • Mathematics, Computer Science
  • STOC '99
  • 1999
In this paper we give approximation algorithms for the following problems on metric spaces: Furthest Pair, kmedian, Minimum Routing Cost Spanning Tree, Multiple Sequence Alignment, Maximum TravelingExpand
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
TLDR
A family of algorithms are given that achieve logarithmic length query time, after subquadratic time and space preprocessing and an interesting trade-off between the stretch factor, the query time and the preprocessing bounds. Expand
Graph minors. V. Excluding a planar graph
We prove that for every planar graph H there is a number w such that every graph with no minor isomorphic to H can be constructed from graphs with at most w vertices, by piecing them together in aExpand
...
1
2
3
4
5
...