Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03657642n
Noun Named Entity
Categories: Network flow, Theorems in graph theory, Combinatorial optimization
EN
max-flow min-cut theorem  Max-flow, mincut theorem  Max-flow-min-cut  max-flow min-cut  Max flow in networks
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
Theorem in optimization theory Wikidata
IS A
theorem
USE
flow network
Wikipedia
EN
max-flow min-cut theorem
Wikidata
EN
Max-flow min-cut theorem
Wikipedia Redirections
EN
Max-flow, mincut theorem, Max-flow-min-cut, max-flow min-cut, Max-Flow Min-Cut theorem, Max flow in networks, Max flow min cut, Max flow min cut theorem, Maxflow-mincut, Maximum flow, minimum cut theorem, Maximum flow/minimum cut theorem, Maximum flow minimum cut theorem, MFMC, Min cut max flow, minimal cut

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License