Definitions from Wikipedia (Max-flow min-cut theorem)

▸ noun:  In computer science and optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the total weight of the edges in a minimum cut, i.e., the smallest total weight of the edges which if removed would disconnect the source from the sink.


▸ Words similar to max-flow min-cut theorem
▸ Usage examples for max-flow min-cut theorem

▸ Idioms related to max-flow min-cut theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near max-flow min-cut theorem
▸ Rhymes of max-flow min-cut theorem

▸ Invented words related to max-flow min-cut theorem