268 search results - page 6 / 54 » Finding the k Shortest Paths |
150
click to vote
CCCG
2006
15 years 7 months ago
2006
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 ...
171
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
164
Voted
ICPP
2009
IEEE
16 years 11 days ago
2009
IEEE
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
140
click to vote
SIAMCOMP
2010
15 years 14 days ago
2010
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...