552 search results - page 38 / 111 » Constrained Shortest Path Computation |
82
Voted
GD
2009
Springer
15 years 2 months ago
2009
Springer
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
ISMB
1997
14 years 11 months ago
1997
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...
PC
2010
14 years 8 months ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
100
click to vote
MMNS
2004
14 years 11 months ago
2004
Existing multicast traffic engineering (TE) solutions tend to use explicit routing through MPLS tunnels. In this paper we shift away from this overlay approach and address the band...