max-flow min-cut theorem

(redirected from 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

Mentioned in ?

Ford-Fulkerson theorem
generalized max-flow min-cut theorem

Full browser ?

▲
Max Delbrueck
Max Delbrueck
Max Delbrueck Center
Max Dessoir
MAX dimerisation protein 1
MAX dimerisation protein 2
Max dimerizer 1
Max Doctor Kurt
Max Dvorak
Max Dvorák
Max Ebert
Max Edgar Mallowan
Max Ellenberg
Max Elskamp
Max Ernst
Max Ernst
Max Ernst
Max Euwe
Max F. J. C. Wolf
Max F. Perutz
Max F. Perutz
Max F. Perutz Laboratories
max fax
max fax surgery
Max Ferdinand Perutz
Max Ferdinand Perutz
Max Ferdinand Perutz
Max flow
Max flow in networks
Max flow min cut
Max flow min cut theorem
Max Franz Joseph Cornelius Wolf
Max Friedlaender
Max Friedlander
Max Friedländer
Max Friedmann
Max Frisch
Max Gansslen
Max Goldmann
Max Grob
Max Headroom
Max Healthcare Institute Limited
Max Hermann Friedrich Lohlein
Max Herrmann
Max Herz
Max Hobbs Political Memorabilia
Max Hoffmann
Max Holz
Max Hölz
Max Horkheimer
Max Horkheimer
Max Huhner
MAX interacting protein 1
MAX interactor 1
Max J Oertel
Max J. Oertel
Max Jacob
Max Jaffe
Max Jean-Gilles
Max Jessner
Max Johann Schultze
▼

CITE

Site: Follow: Share:

Open / Close