552 search results - page 18 / 111 » Constrained Shortest Path Computation |
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
FOCS
1992
IEEE
14 years 1 months ago
1992
IEEE
Abstract Summary of results The subcubic (O(n ) for < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they d...
ICCTA
2007
IEEE
14 years 3 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...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Circular shortest path algorithms for polar objects segmentation have been proposed in [1, 11, 10] to address discrete case and extended in [2] to the continuous domain for closed...