99 search results - page 2 / 20 » Distance Approximation in Bounded-Degree and General Sparse ... |
98
Voted
INFOCOM
2011
IEEE
14 years 27 days 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...
117
Voted
CORR
2012
Springer
13 years 5 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...
127
click to vote
ICALP
2011
Springer
14 years 28 days ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
72
Voted
CORR
2008
Springer
14 years 9 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...
NIPS
2007
14 years 11 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...