552 search results - page 43 / 111 » Constrained Shortest Path Computation |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
GMP
2006
IEEE
15 years 3 months ago
2006
IEEE
Geodesic paths and distances on meshes are used for many applications such as parameterization, remeshing, mesh segmentation, and simulations of natural phenomena. Noble works to c...
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
ICPP
2009
IEEE
15 years 4 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...