References
- Lee, C., & Oruc, A. (1995). A fast parallel algorithm for routing unicast assignments in Benes networks. IEEE Transactions on Parallel and Distributed Systems, Vol. 6, Issue 3, 329-334.10.1109/71.372780
- Maleki, S., Nguyen, D., Lenharth, A., Garzarán, M., Padua, D., & Pingali, K. (2016). DSMR: A parallel algorithm for single-source shortest path problem. Proceedings of the International Conference on Supercomputing, Turkey.10.1145/2925426.2926287
- Prasad, A., Krishnamurthy, S., & Kim, Y. (2018). Acceleration of Dijkstra’s algorithm on multi-core processors. International Conference on Electronics, Information, and Communication, USA.10.23919/ELINFOCOM.2018.8330701
- Singh, D., & Khar, N. (2016). Modified Dijkstra’s algorithm for dense graphs on GPU using CUDA. Indian Journal of Science and Technology, Vol. 9, Issue 33, 1-9.10.17485/ijst/2016/v9i33/87795