Publisher
Springer Nature Switzerland
Reference19 articles.
1. Bast, H., et al.: Route planning in transportation networks. In: Kliemann, L., Sanders, P. (eds) Algorithm Engineering. LNCS, vol 9220. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49487-6_2
2. Ha, M., Tran, D.-M., Shichkina, Y.: Model of message transmission across parallel route groups with dynamic alternation of these groups in a multichannel steganographic system. Electronics 12, 4155 (2023). https://doi.org/10.3390/electronics12194155
3. Zhao, X., Sala, A., Zheng, H., Zhao, B.Y.: Efficient shortest paths on massive social graphs. In: 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom), Orlando, FL, USA, pp. 77–86 (2011)
4. Jasika, N., Alispahic, N., Elma, A., Ilvana, K., Elma, L., Nosovic, N.: Dijkstra's shortest path algorithm serial and parallel execution performance analysis. In: 2012 Proceedings of the 35th International Convention MIPRO, Opatija, Croatia, pp. 1811–1815 (2012)
5. Parimala, M., Broumi, S., Prakash, K., et al.: Bellman-Ford algorithm for solving shortest path problem of a network under picture fuzzy environment. Complex Intell. Syst. 7, 2373–2381 (2021). https://doi.org/10.1007/s40747-021-00430-w