253 search results - page 1 / 51 » Faster Approximation of Distances in Graphs |
CORR
2012
Springer
12 years 14 days 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...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
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...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
SODA
1998
ACM
13 years 6 months ago
1998
ACM
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...