58 search results - page 3 / 12 » Distance Oracles for Sparse Graphs |
INFOCOM
2011
IEEE
12 years 8 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
SIAMCOMP
2010
13 years 3 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...