46 search results - page 2 / 10 » Fully Dynamic Algorithms for Maintaining Shortest Paths Tree... |
LATIN
2000
Springer
13 years 9 months ago
2000
Springer
ESA
2004
Springer
13 years 11 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
ENTCS
2007
13 years 5 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
COMCOM
2000
13 years 5 months ago
2000
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...