maximum flow problem


Also found in: Wikipedia.

maximum flow problem

[¦mak·sə·məm ′flō ‚präb·ləm]
(mathematics)
The problem of finding a feasible flow in an s-t network with the largest possible flow value for a given weight function.
References in periodicals archive ?
The maximum flow problem is logspace complete for P.
Gomory and Hu [35] introduced the concept of a flow equivalent tree and observed that the edge connectivity could be found by solving only n--1 maximum flow problems.
Full browser ?