552 search results - page 70 / 111 » Constrained Shortest Path Computation |
71
Voted
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
EMMCVPR
2003
Springer
15 years 2 months ago
2003
Springer
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
88
Voted
ESA
2010
Springer
14 years 10 months ago
2010
Springer
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...
67
Voted
COMGEO
2007
ACM
14 years 9 months ago
2007
ACM
Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all...
WG
2010
Springer
14 years 8 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...