390 search results - page 8 / 78 » Computing shortest paths for any number of hops |
130
click to vote
COMPGEOM
1998
ACM
15 years 6 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
115
click to vote
JSA
2000
15 years 1 months ago
2000
We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a nonfaulty hypercube. The number of faulty nodes and links may b...
111
Voted
SIAMCOMP
2008
15 years 1 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
87
Voted
STACS
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
111
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...