Dynamic Graph Shortest Path Algorithm
暂无分享,去创建一个
[1] Dorothea Wagner,et al. Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study , 2009, SEA.
[2] Thomas W. Reps,et al. An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.
[3] Hans Rohnert,et al. A Dynamization of the All Pairs Least Cost Path Problem , 1985, STACS.
[4] Philip N. Klein,et al. Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..
[5] Satish Rao,et al. Planar graphs, negative weight edges, shortest paths, and near linear time , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[6] Giuseppe F. Italiano,et al. Incremental algorithms for minimal length paths , 1991, SODA '90.
[7] Stefano Mariani,et al. A Finite Element Flux-Corrected Transport Method for Wave Propagation in Heterogeneous Solids , 2009, Algorithms.
[8] Shimon Even,et al. Updating distances in dynamic graphs , 1985 .
[9] Daniele Frigioni,et al. Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs , 1997, STACS.
[10] Edward P. F. Chan,et al. Shortest Path Tree Computation in Dynamic Graphs , 2009, IEEE Transactions on Computers.
[11] Daniele Frigioni,et al. Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.
[12] Thomas W. Reps,et al. On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..