NIST

maximum-flow problem

(classic problem)

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].

Author: PEB

Implementation

Problem explanation and development of Ford-Fulkerson (pseudocode); including solving related problems, like multi-source, vertex capacity, bipartite matching, etc. description and links to implementations (C, Fortran, C++, Pascal, and Mathematica).
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 15 July 2019.
HTML page formatted Mon Jul 15 12:55:43 2019.

Cite this as:
Paul E. Black, "maximum-flow problem", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 15 July 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/maximumflow.html