High Quality Content by WIKIPEDIA articles! In 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 minimum capacity that needs to be removed from the network so that no flow can pass from the source to the sink. The max-flow min-cut theorem is a special case of the duality theorem and can be used to derive the Menger's theorem and the Konig-Egervary Theorem.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.