137 search results - page 5 / 28 » Optimising Node Coordinates for the Shortest Path Problem |
WEA
2004
Springer
14 years 20 days ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
4OR
2010
13 years 5 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
ISAAC
2003
Springer
14 years 16 days ago
2003
Springer
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
IFIP
2004
Springer
14 years 21 days ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...