Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Bellman, R.: On a Routing Problem. Quart. Appl. Math. 16, 87–90 (1958)
2. Dijkstra, E.W.: A Note on two Problems in Connection with Graphs. Numerische Mathematik 1, 269–271 (1959)
3. Lecture Notes in Computer Science;P.G. Franciosa,1997
4. Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully Dynamic Output Bounded Single Source Shortest Path problem. In: ACM-SIAM Symp. Disc. Algo., pp. 212–221 (1996)
5. Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. Journal of Algorithms 34, 251–281 (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献