Definition: The problem of finding the maximum flow between any two vertices of a directed graph.
Also known as network flow problem.
See also flow network, Malhotra-Kumar-Maheshwari blocking flow, Ford-Fulkerson method.
Note: After [CLR90, page 580].
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 2 September 2014.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "maximum-flow problem", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 2 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/maximumflow.html