Author:
Elalouf Amir,Adany Ron,Ceder Avishai (Avi)
Reference7 articles.
1. L. Ford, D. Fulkerson, Maximal flow through a network, Canadian Journal of Mathematics 8 (3) (1956) 399-404.
2. L. R. Ford, D.R. Fulkerson, Flows in networks, Princeton University Press, 1962.
3. J. Edmonds, R. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, Journal of the ACM (JACM) 19.2((1972) 248-264.
4. T. L. M. Ravindra K. Ahuja, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, 1993.
5. R. Ahuja, J. Orlin, A capacity scaling algorithm for the constrained maximum flow problem, Networks 25 (2) (1995) 89-98.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献