473 search results - page 26 / 95 » Computing shortest paths with uncertainty |
FCT
2007
Springer
15 years 3 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
JUCS
2010
14 years 8 months ago
2010
: We prove that two conditions are sufficient, and with three exceptions also necessary, for reachability of any position in restricted walk on integers in which the sizes of the m...
LATIN
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
GISCIENCE
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However...