Author:
Rebennack Steffen,Arulselvan Ashwin,Elefteriadou Lily,Pardalos Panos M.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference21 articles.
1. Ahuja RK, Magnati TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs
2. Bern MW, Lawler EL, Wong AL (1987) Linear-time computation of optimal subgraph of decomposable graphs. J Algorithms 8:216–235
3. Burkard R, Dlaska K, Klinz B (1993) The quickest flow problem. Math Methods Oper Res 37(1):31–58
4. Cheriyan J, Maheshwari SN (1989) Analysis of preflow push algorithm for maximum network flow. SIAM J Comput 18:1057–1086
5. Ford FR, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献