Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Max-flow_min-cut_theorem> ?p ?o }
Showing triples 1 to 80 of
80
with 100 triples 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 wikiPageLength "15990".
- Max-flow_min-cut_theorem wikiPageOutDegree "37".
- Max-flow_min-cut_theorem wikiPageRevisionID "704332456".
- Max-flow_min-cut_theorem wikiPageWikiLink Approximate_max-flow_min-cut_theorem.
- Max-flow_min-cut_theorem wikiPageWikiLink Category:Combinatorial_optimization.
- Max-flow_min-cut_theorem wikiPageWikiLink Category:Theorems_in_graph_theory.
- Max-flow_min-cut_theorem wikiPageWikiLink Christos_Papadimitriou.
- Max-flow_min-cut_theorem wikiPageWikiLink Claude_Shannon.
- Max-flow_min-cut_theorem wikiPageWikiLink D._R._Fulkerson.
- Max-flow_min-cut_theorem wikiPageWikiLink Duality_(optimization).
- Max-flow_min-cut_theorem wikiPageWikiLink Edmonds–Karp_algorithm.
- Max-flow_min-cut_theorem wikiPageWikiLink File:Max-flow_min-cut_example.svg.
- Max-flow_min-cut_theorem wikiPageWikiLink File:Max-flow_min-cut_project-selection.svg.
- Max-flow_min-cut_theorem wikiPageWikiLink Flow_network.
- Max-flow_min-cut_theorem wikiPageWikiLink Ford–Fulkerson_algorithm.
- Max-flow_min-cut_theorem wikiPageWikiLink Glossary_of_graph_theory.
- Max-flow_min-cut_theorem wikiPageWikiLink Kenneth_Steiglitz.
- Max-flow_min-cut_theorem wikiPageWikiLink Kxc5x91nigs_theorem_(graph_theory).
- Max-flow_min-cut_theorem wikiPageWikiLink L._R._Ford,_Jr..
- Max-flow_min-cut_theorem wikiPageWikiLink Linear_programming.
- Max-flow_min-cut_theorem wikiPageWikiLink Mathematical_optimization.
- Max-flow_min-cut_theorem wikiPageWikiLink Maximum_flow_problem.
- Max-flow_min-cut_theorem wikiPageWikiLink Mengers_theorem.
- Max-flow_min-cut_theorem wikiPageWikiLink Minimum_cut.
- Max-flow_min-cut_theorem wikiPageWikiLink Peter_Elias.
- Max-flow_min-cut_theorem wikiPageWikiLink Strong_duality.
- Max-flow_min-cut_theorem wikiPageWikiLink Vijay_Vazirani.
- Max-flow_min-cut_theorem wikiPageWikiLink File:Image_segmentation.jpg.
- Max-flow_min-cut_theorem wikiPageWikiLinkText "MINCUT".
- Max-flow_min-cut_theorem wikiPageWikiLinkText "Max-flow Min-cut theorem".
- Max-flow_min-cut_theorem wikiPageWikiLinkText "Max-flow min-cut theorem of networks".
- Max-flow_min-cut_theorem wikiPageWikiLinkText "Max-flow min-cut theorem".
- Max-flow_min-cut_theorem wikiPageWikiLinkText "linear program".
- Max-flow_min-cut_theorem wikiPageWikiLinkText "max-flow min-cut theorem".
- Max-flow_min-cut_theorem wikiPageWikiLinkText "max-flow min-cut".
- Max-flow_min-cut_theorem wikiPageWikiLinkText "max-flow/min-cut".
- Max-flow_min-cut_theorem wikiPageWikiLinkText "maximum flow".
- Max-flow_min-cut_theorem wikiPageWikiLinkText "minimum ''s''-''t'' cut".
- Max-flow_min-cut_theorem wikiPageUsesTemplate Template:!.
- Max-flow_min-cut_theorem wikiPageUsesTemplate Template:=.
- Max-flow_min-cut_theorem wikiPageUsesTemplate Template:Cite_book.
- Max-flow_min-cut_theorem wikiPageUsesTemplate Template:Math.
- Max-flow_min-cut_theorem wikiPageUsesTemplate Template:Mvar.
- Max-flow_min-cut_theorem wikiPageUsesTemplate Template:Ref.
- Max-flow_min-cut_theorem wikiPageUsesTemplate Template:Reflist.
- Max-flow_min-cut_theorem wikiPageUsesTemplate Template:See_also.
- 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 hypernym Case.
- Max-flow_min-cut_theorem type SupremeCourtOfTheUnitedStatesCase.
- Max-flow_min-cut_theorem type Algorithm.
- Max-flow_min-cut_theorem type Redirect.
- Max-flow_min-cut_theorem type Theorem.
- Max-flow_min-cut_theorem type Thing.
- 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 seeAlso Maximum_flow_problem.
- Max-flow_min-cut_theorem seeAlso Mengers_Theorem.
- Max-flow_min-cut_theorem seeAlso Mengers_theorem.
- Max-flow_min-cut_theorem sameAs Q608294.
- Max-flow_min-cut_theorem sameAs Teorema_de_flux_màxim_tall_mínim.
- 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 برش_کمینه.
- Max-flow_min-cut_theorem sameAs coupe-min.
- Max-flow_min-cut_theorem sameAs משפט_זרימה_מקסימלית_-_חתך_מינימלי.
- Max-flow_min-cut_theorem sameAs Maximális_folyam-minimális_vágás.
- Max-flow_min-cut_theorem sameAs Teorema_del_flusso_massimo_e_taglio_minimo.
- 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 Теорема_Форда_—_Фалкерсона.
- Max-flow_min-cut_theorem sameAs Max-flöde,_minsta-snitt.
- Max-flow_min-cut_theorem sameAs Định_lý_luồng_cực_đại_lát_cắt_cực_tiểu.
- Max-flow_min-cut_theorem sameAs Q608294.
- Max-flow_min-cut_theorem wasDerivedFrom Max-flow_min-cut_theorem?oldid=704332456.
- Max-flow_min-cut_theorem isPrimaryTopicOf Max-flow_min-cut_theorem.