39 search results - page 3 / 8 » Dynamic Multi-level Overlay Graphs for Shortest Paths |
WEA
2009
Springer
14 years 3 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
JDA
2006
13 years 8 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
SIROCCO
1998
13 years 10 months ago
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
4OR
2010
13 years 7 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. ...
EMMCVPR
2007
Springer
14 years 15 days ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...