Author:
Zhang Lin,Yang Zhaosheng,Jia Hongmei,Wang Bin,Chen Guang
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Chabini, I., Ganugapati, S.: Parallel algorithms for dynamic shortest path problems. International Transactions in Operational Research 9(3), 279–302 (2002)
2. Tremblay, N., Florian, M.: Temporal shortest paths: parallel computing implementations. Parallel Comput. 27, 1569–1609 (2001)
3. Simon, H.D.: Partitioning of unstructured problems for parallel processing. In: Proc. Conference on Parallel Methods on Large Scale Structural Analysis and Physics Applications. Pergammon Press, Oxford (1991)
4. Herberg, U.: Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2. In: 8th Annual Communication Networks and Services Research Conference (2010)
5. O’Cearbhaill, E.A., O’Mahony, M.: Parallel implementation of a transportation network model. Journal of Parallel and Distributed Computing 65, 1–14 (2005)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献