422 search results - page 7 / 85 » Shortest paths between shortest paths and independent sets |
ICCSA
2004
Springer
14 years 25 days ago
2004
Springer
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
ICPP
2009
IEEE
14 years 2 months 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...
SIAMCOMP
2010
13 years 2 months 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...
PSIVT
2007
Springer
14 years 1 months ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...