Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Max-flow_min-cut_theorem> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- Max-flow_min-cut_theorem abstract "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, 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.".
- Max-flow_min-cut_theorem wikiPageID "78130".
- Max-flow_min-cut_theorem wikiPageRevisionID "606584533".
- Max-flow_min-cut_theorem hasPhotoCollection Max-flow_min-cut_theorem.
- Max-flow_min-cut_theorem subject Category:Combinatorial_optimization.
- Max-flow_min-cut_theorem subject Category:Theorems_in_graph_theory.
- Max-flow_min-cut_theorem type Abstraction100002137.
- Max-flow_min-cut_theorem type Communication100033020.
- Max-flow_min-cut_theorem type Message106598915.
- Max-flow_min-cut_theorem type Proposition106750804.
- Max-flow_min-cut_theorem type Statement106722453.
- Max-flow_min-cut_theorem type Theorem106752293.
- Max-flow_min-cut_theorem type TheoremsInDiscreteMathematics.
- Max-flow_min-cut_theorem comment "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, 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.".
- Max-flow_min-cut_theorem label "Max-Flow-Min-Cut-Theorem".
- Max-flow_min-cut_theorem label "Max-flow min-cut theorem".
- Max-flow_min-cut_theorem label "Max-flow-min-cut-stelling".
- Max-flow_min-cut_theorem label "Teorema do Fluxo Máximo–Corte Mínimo".
- Max-flow_min-cut_theorem label "Théorème flot-max/coupe-min".
- Max-flow_min-cut_theorem label "Теорема Форда — Фалкерсона".
- Max-flow_min-cut_theorem label "最大フロー最小カット定理".
- Max-flow_min-cut_theorem sameAs Fordova-Fulkersonova_věta.
- Max-flow_min-cut_theorem sameAs Max-Flow-Min-Cut-Theorem.
- Max-flow_min-cut_theorem sameAs coupe-min.
- Max-flow_min-cut_theorem sameAs 最大フロー最小カット定理.
- Max-flow_min-cut_theorem sameAs Max-flow-min-cut-stelling.
- Max-flow_min-cut_theorem sameAs Teorema_do_Fluxo_Máximo–Corte_Mínimo.
- Max-flow_min-cut_theorem sameAs m.0kf5h.
- Max-flow_min-cut_theorem sameAs Q608294.
- Max-flow_min-cut_theorem sameAs Q608294.
- Max-flow_min-cut_theorem sameAs Max-flow_min-cut_theorem.
- Max-flow_min-cut_theorem wasDerivedFrom Max-flow_min-cut_theorem?oldid=606584533.
- Max-flow_min-cut_theorem isPrimaryTopicOf Max-flow_min-cut_theorem.