Distance oracle

In computing, a distance oracle (DO) is a data structure for calculating distances between vertices in a graph.

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

Computing shortest paths is a fundamental graph problem with many real-life applications. Naive methods such as Dijkstra’s…

2017

Let $G$ be a graph where each vertex is associated with a label. A Vertex-Labeled Approximate Distance Oracle is a data structure…

2015

We present the first approximate distance oracle for sparse directed networks with time-dependent arc-travel-times determined by…

2015

Distance computation (e.g., computing shortest paths) is one of the most fundamental primitives used in communication networks…

2014

Distributed distance oracles consist of a labeling scheme which assigns a label to each node and a local data structure deployed…

2014

Suppose you are given a large network, such as the Internet or the US road network. In many practical applications, one might be…

2013

In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an $n…

2011

Distance computation (e.g., computing shortest paths) is one of the most fundamental primitives used in communication networks…

2011

Distance oracles are data structures that provide fast (possibly approximate) answers to shortest-path and distance queries in…

2009

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 2.