max-flow min-cut theorem


max-flow min-cut theorem

[‚maks¦flō ‚min′kət ‚thir·əm] (industrial engineering) In the analysis of networks, the concept that for any network with a single source and sink, the maximum feasible flow from source to sink is equal to the minimum cut value for any of the cuts of the network. (mathematics) Ford-Fulkerson theorem