Experimental Evaluations of Dynamic Algorithm for Maintaining Shortest-Paths Trees on Real-World Networks
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.
[2] Toshio Yoshii,et al. SOUND : A Traffic Simulation Model for Oversaturated Traffic Flow on Urban Expressways , 2002 .
[3] Ronald L. Rivest,et al. Introduction to Algorithms, third edition , 2009 .
[4] L FredmanMichael,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987 .
[5] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[6] Daniele Frigioni,et al. Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.