58 search results - page 3 / 12 » Distance Oracles for Sparse Graphs |
155
Voted
INFOCOM
2011
IEEE
14 years 6 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...
125
Voted
WADS
2007
Springer
15 years 9 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...
116
click to vote
CORR
2010
Springer
15 years 3 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...
116
Voted
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
123
Voted
SIAMCOMP
2010
15 years 1 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...