Editing Max-flow min-cut theorem (section)

==References==
{{reflist}}
* {{cite book|author=Eugene Lawler | author-link = Eugene Lawler|title = Combinatorial Optimization: Networks and Matroids | chapter = 4.5. Combinatorial Implications of Max-Flow Min-Cut Theorem, 4.6. Linear Programming Interpretation of Max-Flow Min-Cut Theorem | year = 2001 | publisher = Dover | isbn = 0-486-41453-1 | pages = 117–120}}
* {{cite book|author=[[Christos H. Papadimitriou]], [[Kenneth Steiglitz]]|title=Combinatorial Optimization: Algorithms and Complexity | chapter=6.1 The Max-Flow, Min-Cut Theorem | year = 1998| publisher = Dover | isbn = 0-486-40258-4 |pages= 120–128}}
* {{cite book|author=[[Vijay Vazirani|Vijay V. Vazirani]]|title=Approximation Algorithms|chapter=12. Introduction to LP-Duality | year = 2004 | publisher = Springer | isbn = 3-540-65367-8 | pages = 93–100}}

[[Category:Combinatorial optimization]]
[[Category:Theorems in graph theory]]
[[Category:Network flow problem]]