1100 search results - page 2 / 220 » Approximate distance oracles |
ISAAC
2004
Springer
14 years 22 days ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
TALG
2008
13 years 7 months ago
2008
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...