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.

2014

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

2013

We consider vertex-labeled graphs, where each vertex v is attached with a label from a set of labels. The vertex-to-label…

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…

2012

Let G = (V, E) be a directed planar graph on n = |V| vertices, and let s e V be any fixed source vertex. We show that G can be…

2011

Given an undirected graph G with m edges, n vertices, and non-negative edge weights, and given an integer k ≥ 1, we show that for…

2011

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

2010

Given a metric space $(X,d_X)$, the earth mover distance between two distributions over $X$ is defined as the minimum cost of a…

2009

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

2007

We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar…

2004

Let G(V, E) be an undirected weighted graph with |V| = n, |E| = m. Recently Thorup and…