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 E. Black.
Entry modified 22 August 2011.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "maximum-flow problem", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 22 August 2011. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/maximumflow.html