(classic problem)
Definition: See maximum-flow problem.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 22 August 2011.
HTML page formatted Mon Aug 22 09:59:42 2011.
Cite this as:
Paul E. Black, "network 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/networkFlowProblem.html
