Author:
AbuBekr Jewahir,Chikalov Igor,Hussain Shahid,Moshkov Mikhail
Reference12 articles.
1. A note on two problems in connexion with graphs;Dijkstra;Numerische Mathematik,1959
2. On a routing problem;Bellman;Quarterly of Applied Mathematics,1958
3. L.R. Ford, Network flow theory, Tech. Rep. P-923, RAND, Santa Monica, CA (1956).
4. R.W. Floyd, Algorithm 97: Shortest path, Commun. ACM 5 (6) (1962) 345.
5. A theorem on boolean matrices;Warshall;J. ACM,1962
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimal Paths in Directed Graphs;Dynamic Programming Multi-Objective Combinatorial Optimization;2021
2. Introduction;Dynamic Programming Multi-Objective Combinatorial Optimization;2021
3. Extensions of dynamic programming for multi-stage combinatorial optimization;Theoretical Computer Science;2020-12
4. Dynamic programming bi-criteria combinatorial optimization;Discrete Applied Mathematics;2020-09
5. Optimal Paths in Directed Graphs;Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining;2018-05-23