Max-flow Min-cut Theorem

The max-flow min-cut theorem is a special case of the duality theorem for linear programs and can be used to derive Menger's theorem and the König-Egerváry Theorem.

Read more about Max-flow Min-cut Theorem:  Definition, Statement, Linear Program Formulation, Example, History

Famous quotes containing the word theorem:

    “To insure the adoration of a theorem for any length of time, faith is not enough, a police force is needed as well.”
    —Albert Camus (1913–1960)