43 search results - page 4 / 9 » Querying approximate shortest paths in anisotropic regions |
GIS
2010
ACM
14 years 10 months ago
2010
ACM
The growing popularity of online Earth visualization tools and geo-realistic games and the availability of high resolution terrain data have motivated a new class of queries to th...
111
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
127
click to vote
CORR
2012
Springer
13 years 7 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...
112
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
111
click to vote
STOC
2002
ACM
15 years 12 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...