Editing Maximum flow problem (section)

==Further reading==
* {{cite journal
 | author = [[Joseph Cheriyan]] and [[Kurt Mehlhorn]]
 | title = An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
 | journal = Information Processing Letters
 | volume = 69
 | year = 1999
 | pages = 239–242
 | doi = 10.1016/S0020-0190(99)00019-8
 | issue = 5
| citeseerx = 10.1.1.42.8563
 }}
* {{cite journal
 | author = [[Daniel D. Sleator]] and [[Robert E. Tarjan]]
 | title = A data structure for dynamic trees
 | journal = Journal of Computer and System Sciences
 | volume = 26
 | year = 1983
 | issn = 0022-0000
 | pages = 362–391
 | doi = 10.1016/0022-0000(83)90006-5
 | url = https://www.cs.cmu.edu/~sleator/papers/dynamic-trees.pdf
 | issue = 3
}}
* {{cite book | author =  Eugene Lawler | author-link = Eugene Lawler | title = Combinatorial Optimization: Networks and Matroids | chapter = 4. Network Flows | year = 2001 | publisher = Dover | isbn = 978-0-486-41453-9 | pages = 109–177}}

{{DEFAULTSORT:Maximum Flow Problem}}
[[Category:Network flow problem]]
[[Category:Computational problems in graph theory]]