Exact Distance Oracles ( a . k . a . Shortest - Path Queries )
نویسنده
چکیده
r–division approach pieces of size O(r) with boundary O( √ r) per piece (total boundary O(n/ √ r)) precompute APSP for all nodes on the boundary, space O(n/r); at query time, explore piece of v (say Pv) and piece of w (Pw) and find best connection pair ∂Pv × ∂Pw, piece sizes O(r) and O( √ r) connection pairs, total query time O(r) smoothly interpolates between SSSP and APSP (only separators used, extends to minor-free graphs). can we do better?
منابع مشابه
Exact Distance Oracles Using Hopsets
For fixed h ≥ 2, we consider the task of adding to a graph G a set of weighted shortcut edges on the same vertex set, such that the length of a shortest h-hop path between any pair of vertices in the augmented graph is exactly the same as the original distance between these vertices in G. A set of shortcut edges with this property is called an exact h-hopset and may be applied in processing dis...
متن کاملDistance oracles in edge-labeled graphs
A fundamental operation over edge-labeled graphs is the computation of shortest-path distances subject to a constraint on the set of permissible edge labels. Applying exact algorithms for such an operation is not a viable option, especially for massive graphs, or in scenarios where the distance computation is used as a primitive for more complex computations. In this paper we study the problem ...
متن کاملDistance Oracles for Vertex-Labeled Graphs
Given a graph G = (V,E) with non-negative edge lengths whose vertices are assigned a label from L = {λ1, . . . , λl}, we construct a compact distance oracle that answers queries of the form: “What is δ(v, λ)?”, where v ∈ V is a vertex in the graph, λ ∈ L a vertex label, and δ(v, λ) is the distance (length of a shortest path) between v and the closest vertex labeled λ in G. We formalize this nat...
متن کاملMore Compact Oracles for Approximate Distances in Undirected Planar Graphs
Distance oracles are data structures that provide fast (possibly approximate) answers to shortest-path and distance queries in graphs. The tradeoff between the space requirements and the query time of distance oracles is of particular interest and the main focus of this paper. Unless stated otherwise, we assume all graphs to be planar and undirected. In FOCS 2001 (J. ACM 2004), Thorup introduce...
متن کاملDistance Oracles for Sparse Graphs
Suppose you are given a large network, such as the Internet or the US road network. In many practical applications, one might be interested in querying shortest path distances between pairs of nodes of the network. However, attempting to implement a data structure that supports such operations will result either in a large query time, or large space requirement, both of which are undesirable. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011