253 search results - page 4 / 51 » Faster Approximation of Distances in Graphs |
163
Voted
ISAAC
2004
Springer
15 years 11 months 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...
152
click to vote
FOCS
2009
IEEE
16 years 16 days ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
185
click to vote
FSTTCS
2010
Springer
15 years 3 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...