467 search results - page 20 / 94 » Acceleration of Shortest Path and Constrained Shortest Path ... |
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper we study the Carnot-Caratheodory metrics on SU(2) S3 , SO(3) and SL(2) induced by their Cartan decomposition and by the Killing form. Besides computing explicitly...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
MICS
2008
13 years 8 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
ACSC
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
FOCS
1994
IEEE
14 years 1 days ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...