866 search results - page 33 / 174 » On Dynamic Shortest Paths Problems |
STOC
2002
ACM
14 years 7 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...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
PAMI
2010
13 years 6 months ago
2010
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...