Publisher
Springer Berlin Heidelberg
Reference50 articles.
1. Ahuja, R.K., Orlin, J.B.: A fast and simple algorithm for the maximum flow problem. Oper. Res. 37, 748–759 (1989)
2. Optimization;R.K. Ahuja,1989
3. Ahuja, R.K., Orlin, J.B., Tarjan, R.E.: Improved time bounds for the maximum flow problem. SIAM J. Comput. 18, 939–954 (1989)
4. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Some recent advances in network flows. SIAM Rev. 33, 175–219 (1991)
5. Ahuja, R.K., Kodialam, M., Mishra, A.K., Orlin, J.B.: Computational testing of maximum flow algorithms. Sloan working paper, Sloan School of Management, MIT (1992)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Overlaying a Hypergraph with a Graph with Bounded Maximum Degree;Algorithms and Discrete Applied Mathematics;2020
2. Flüsse mit minimalen Kosten;Kombinatorische Optimierung;2018
3. Netzwerkflüsse;Kombinatorische Optimierung;2018
4. Das Traveling-Salesman-Problem;Kombinatorische Optimierung;2018