References
Chen, L., Kyng, R., Liu, Y. P., Peng, R., Gutenberg, M. P., & Sachdeva, S. (2022, October). Maximum flow and minimum-cost flow in almost linear time. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (pp. 612-623). IEEE.
Johnson, D. B. (1973). A note on Dijkstra’s shortest path algorithm. Journal of the ACM (JACM), 20(3), 385-388.
Kang, N. K., Son, H. J., & Lee, S. H. (2018). Modified A-star algorithm for modular plant land transportation. Journal of Mechanical Science and Technology, 32, 5563-5571.
Little, J. D., Murty, K. G., Sweeney, D. W., & Karel, C. (1963). An algorithm for the traveling salesman problem. Operations research, 11(6), 972-989.
Liu, S., Münch, F., & Peyerimhoff, N. (2018). Bakry–Émery curvature and diameter bounds on graphs. Calculus of Variations and Partial Differential Equations, 57, 1-9.
Rondinelli, D., & Berry, M. (2000). Multimodal transportation, logistics, and...