New dynamic algorithms for shortest path tree computation
Citations
[...]
584 citations
Cites methods from "New dynamic algorithms for shortest..."
...For example, in “most of today’s commercial routers, this recomputation is done by deleting the current SPT [shortest-path tree] and recomputing it from scratch by using the well known Dijkstra algorithm” [12] although it has recently been discovered in the networking literature that DynamicSWSF-FP can be used to update routing tables as the congestion of links changes [12,13]....
[...]
379 citations
Cites background from "New dynamic algorithms for shortest..."
...Note that the LP solution includes the visibility information on all pairs of nodes for all the obstacles, which allows for a fast incremental update of the visibility graph when the environment changes [83, 84]....
[...]
289 citations
Additional excerpts
...Several algorithms have been proposed to analyze the structure of highdimensional data based on the notion of manifold learning....
[...]
284 citations
252 citations
Cites background from "New dynamic algorithms for shortest..."
...The variations of single-source shortest-path problem and related issues have been intensively studied in the areas of transportation [15, 12, 13, 17, 2, 29, 21], navigation systems [24, 14, 3, 9], and networks [18, 19]....
[...]
References
22,704 citations
"New dynamic algorithms for shortest..." refers methods in this paper
...When the static version of the initialization procedure is used, this algorithm is equivalent to the Dijkstra algorithm [ 7 ]....
[...]
...In most of today’s commercial routers, this recomputation is done by deleting the current SPT and recomputing it from scratch by using the well-known Dijkstra algorithm [ 7 ]....
[...]
21,651 citations
"New dynamic algorithms for shortest..." refers methods or result in this paper
...The Fibonacci Dijkstra algorithm uses the data structure of a Fibonacci heap to implement the priority queue for . Although the algorithm has the lowest asymptotic complexity among others shown above, it is mostly of theoretical interest because of the large constant overhead involved in operating Fibonacci heaps [ 5 ]....
[...]
...For comparison with the well-known static algorithms, we state the following known results regarding their complexity [ 5 ]:...
[...]
[...]
2,586 citations
[...]
2,413 citations
1,365 citations