Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms (Addison-Wesley, Reading, MA, 1974).
2. R.V. Cherkasky, “Algorithm of construction of maximal flow in networks with complexity of
$$O(V^2 \sqrt E$$
operations” (in Russian), Mathematical Methods of Solution of Economical Problems 7 (1977) 112–125.
3. T.-Y. Cheung, “Computational comparison of eight methods for the maximum flow problem,” ACM Transactions on Mathematical Software 6 (1980) 1–16.
4. R.B. Dial, “Algorithm 360: Shortest path forest with topological ordering”, Communications of the ACM 12 (1969) 632–633.
5. E.W. Dijkstra, “A note on two problems in connexion with graphs”, Numerische Mathematik 1 (1959) 269–271.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献