max-flow min-cut theorem

Also found in: Wikipedia

0.02 sec.

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

How to thank TFD for its existence? Tell a friend about us, add a link to this page, add the site to iGoogle, or visit webmaster's page for free fun content.

?Page tools

Printer friendly
Cite / link

Email
Feedback

? Mentioned in

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

Encyclopedia browser

? Full browser

Mawson
Mawson, Sir Douglas
Mawworm
max
Max of Baden
Max, Gabriel
Max, Peter
max-flow min-cut theorem
max-wind and shear chart
max-wind level
max-wind topography
Maxentius
maxi
maxilla
maxillary air sinus

Max'ed Warsame Cali (Kiimiko)
Max's
Max's Kansas City
Max's of Manila
Max's Restaurant
Max's Shrew
Max, 13
Max, Adolphe Eugene Jean
Max, Gabriel
Max, Gabriel
Max, Mon Amour
Max, ND
Max, North Dakota
Max, Peter
Max,13
MAX-03 Adzam

MAX-3LIN-EQN
MAX-3SAT
MAX-3SAT(13)
Max-A-Million
Max-Alain Gradel
Max-Born-Institute
Max-cardinality ordering
Max-Flow Min-Cut
max-flow min-cut theorem
Max-flow, mincut theorem
Max-flow, mincut theorem
Max-Hellmuth Ostermann
MAX-lab
MAX-MIN Ant System
Max-min fair
Max-min fair scheduling
Max-min fairness

Encyclopedia

Free Tools:	For surfers: Free toolbar & extensions \| Word of the Day \| Help For webmasters: Free content \| Linking \| Lookup box \| Double-click lookup \| Partner with us

All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. Terms of Use.