11 search results - page 2 / 3 » Algorithms for Approximate Shortest Path Queries on Weighted... |
W2GIS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
COCOON
2001
Springer
13 years 10 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
ALGORITHMICA
2011
13 years 20 days 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...
PODC
2006
ACM
13 years 11 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...