Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. F. Chin and D. Houck, Algorithms for updating minimal spanning trees, J. Comput. System Sciences, 16(3) (1978) 333–344.
2. B. Dixon, M. Rauch and R.E. Tarjan, Verification and sensitivityanaly sis of minimum spanning trees in linear time, SIAM J. Comput., 21(6) (1992) 1184–1192.
3. M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. of the ACM, 34(3) (1987) 596–615.
4. D. Frigioni, A. Marchetti-Spaccamela and U. Nanni, Fullydy namic output bounded single source shortest path problem, Proc. 7th ACM-SIAM Symposium on Discrete Algorithms (SODA’96), 1996, 212–221.
5. D. Frigioni, M. Ioffreda, U. Nanni and G. Pasquale, Experimental analysis of dynamic algorithms for the single-source shortest-path problem, ACM J. of Experimental Algorithms, 3, article 5, (1998).
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献