763 search results - page 22 / 153 » Engineering Shortest Path Algorithms |
COCO
2000
Springer
13 years 12 months ago
2000
Springer
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
ICCTA
2007
IEEE
14 years 1 months ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
ICN
2005
Springer
14 years 1 months ago
2005
Springer
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classi...
SODA
2007
ACM
13 years 9 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
CAIP
2007
Springer
13 years 11 months ago
2007
Springer
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary a...