3678 search results - page 172 / 736 » On the Stable Paths Problem |
130
click to vote
COMPGEOM
1990
ACM
15 years 7 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
133
Voted
EUC
2008
Springer
15 years 5 months ago
2008
Springer
Static path analysis is a key process of Worst Case Execution Time (WCET) estimation, the objective of which is to find the execution path that has the largest execution time. Cur...
108
Voted
CCCG
2007
15 years 5 months ago
2007
We study the problem of drawing a graph-theoretic path where each edge is assigned an axis-parallel direction in 3D. Di Battista et al.[3] gives a combinatorial characterization f...
119
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
151
Voted
CORR
2007
Springer
15 years 3 months ago
2007
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 ...