425 search results - page 1 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
LATIN
2000
Springer
15 years 1 months ago
2000
Springer
JAL
2000
14 years 10 months ago
2000
109
Voted
ALGORITHMICA
1998
14 years 10 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
94
Voted
JCP
2007
14 years 10 months ago
2007
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
92
Voted
JDA
2006
14 years 10 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...