Editing Flow network (section)

== Further reading ==
* {{cite book |author1=George T. Heineman |author2=Gary Pollice |author3=Stanley Selkow | title= Algorithms in a Nutshell | publisher=[[Oreilly Media]] | year=2008 | chapter=Chapter 8:Network Flow Algorithms | pages = 226–250 | isbn=978-0-596-51624-6 }}
* {{cite book | author1=[[Ravindra K. Ahuja]] | author2=[[Thomas L. Magnanti]] | author3=[[James B. Orlin]] | title= Network Flows: Theory, Algorithms and Applications | publisher=Prentice Hall | year=1993 | isbn=0-13-617549-X }}
* {{cite book | author=Bollobás, Béla | title= Graph Theory: An Introductory Course | location=Heidelberg | publisher=Springer-Verlag | year=1979 | isbn=3-540-90399-2| author-link= Béla Bollobás }}
* {{cite book | author1=[[Chartrand, Gary]] |author2=[[Ortrud Oellermann|Oellermann, Ortrud R.]] | title=Applied and Algorithmic Graph Theory | location=New York | publisher=McGraw-Hill | year=1993 | isbn=0-07-557101-3}}
* {{cite book | author=Even, Shimon | title=Graph Algorithms | location=Rockville, Maryland | publisher=Computer Science Press | year=1979 | isbn=0-914894-21-8 | url-access=registration | url=https://archive.org/details/graphalgorithms0000even }}
* {{cite book | author=Gibbons, Alan | title=Algorithmic Graph Theory | location=Cambridge | publisher=Cambridge University Press | year=1985 | isbn=0-521-28881-9 }}
* {{cite book | author1= [[Thomas H. Cormen]]| author2=[[Charles E. Leiserson]]| author3=[[Ronald L. Rivest]]| author4=[[Clifford Stein]] | title = Introduction to Algorithms | orig-year = 1990 | edition = 2nd | year = 2001 | publisher = MIT Press and McGraw-Hill | pages = 696–697 | chapter = 26 | isbn = 0-262-03293-7| title-link = Introduction to Algorithms }}