最大フロー最小カット定理
1. Max-flow min-cut theoremIn 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 which when removed in a specific way from the network causes the situation 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 for linear programs and can be used to derive Menger's theorem and the König-Egerváry Theorem.
Read “Max-flow min-cut theorem” on English Wikipedia
Read “最大フロー最小カット定理” on Japanese Wikipedia
Read “Max-flow min-cut theorem” on DBpedia
Read “Max-flow min-cut theorem” on English Wikipedia
Read “最大フロー最小カット定理” on Japanese Wikipedia
Read “Max-flow min-cut theorem” on DBpedia
Discussions
Log in to talk about this word.