Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Bauer, R., Wagner, D.: Batch dynamic single-source shortest-path algorithms: An experimental study. Experimental Algorithms 2, 1–20 (2009)
2. Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. Theoretical Computer Science 158(1-2), 233–277 (1996)
3. Even, S., Gazit, H.: Updating distances in dynamic graphs. J. Algorithms (1985)
4. Lecture Notes in Computer Science;H. Rohnert,1984
5. Ramalingam, G.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms (1991)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献