Author:
Bhattacharyya Subhajit,Karmakar Mousumi
Publisher
Springer Nature Singapore
Reference14 articles.
1. Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Springer-Verlag, New York, Inc. (1959)
2. Zhang, X., Chen, Y., Li, T.: Optimization of logistics route based on Dijkstra. In: IEEE International Conference on Software Engineering and Service Science, pp. 313–316. IEEE (2015)
3. Samah, K.A.F.A.: Modification of Dijkstra’s algorithm for safest and shortest path during emergency evacuation. Appl. Math. Sci. 9(31), 1531–1541 (2015). https://doi.org/10.12988/ams.2015.49681, www.m-hikari.com
4. Bozyigit, A., Alankus, G., Nasiboglu, E.: Public transport route planning: modified Dijkstra’s algorithm. In: International Conference on Computer Science & Engineering. IEEE (2017)
5. Wei, K., Gao, Y., Zhang, W., Lin, S.: A modified Dijkstra’s algorithm for solving the problem of finding the maximum load path. In: IEEE 2nd International Conference on Information and Computer Technologies. IEEE (2019). 978-1-7281-3323-2/19/$31.00