Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Maximum_flow_problem> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- Maximum_flow_problem abstract "In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum.The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. The maximum value of an s-t flow (i.e., flow from source s to sink t) is equal to the minimum capacity of an s-t cut (i.e., cut severing s from t) in the network, as stated in the max-flow min-cut theorem.".
- Maximum_flow_problem thumbnail Max_flow.svg?width=300.
- Maximum_flow_problem wikiPageExternalLink 0020-0190(78)90016-9.
- Maximum_flow_problem wikiPageExternalLink Max_flows_in_O(nm)_time.html.
- Maximum_flow_problem wikiPageExternalLink dynamic-trees.pdf.
- Maximum_flow_problem wikiPageID "403165".
- Maximum_flow_problem wikiPageRevisionID "605412195".
- Maximum_flow_problem hasPhotoCollection Maximum_flow_problem.
- Maximum_flow_problem subject Category:Mathematical_problems.
- Maximum_flow_problem subject Category:Network_flow.
- Maximum_flow_problem type Abstraction100002137.
- Maximum_flow_problem type Attribute100024264.
- Maximum_flow_problem type Condition113920835.
- Maximum_flow_problem type Difficulty114408086.
- Maximum_flow_problem type MathematicalProblems.
- Maximum_flow_problem type Problem114410605.
- Maximum_flow_problem type State100024720.
- Maximum_flow_problem comment "In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum.The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. The maximum value of an s-t flow (i.e., flow from source s to sink t) is equal to the minimum capacity of an s-t cut (i.e., cut severing s from t) in the network, as stated in the max-flow min-cut theorem.".
- Maximum_flow_problem label "Maximum flow problem".
- Maximum_flow_problem label "Problem maksymalnego przepływu".
- Maximum_flow_problem label "Problema da vazão máxima".
- Maximum_flow_problem label "Problème de flot maximum".
- Maximum_flow_problem label "Задача о максимальном потоке".
- Maximum_flow_problem label "最大フロー問題".
- Maximum_flow_problem sameAs Problème_de_flot_maximum.
- Maximum_flow_problem sameAs 最大フロー問題.
- Maximum_flow_problem sameAs Problem_maksymalnego_przepływu.
- Maximum_flow_problem sameAs Problema_da_vazão_máxima.
- Maximum_flow_problem sameAs m.024354.
- Maximum_flow_problem sameAs Q2585642.
- Maximum_flow_problem sameAs Q2585642.
- Maximum_flow_problem sameAs Maximum_flow_problem.
- Maximum_flow_problem wasDerivedFrom Maximum_flow_problem?oldid=605412195.
- Maximum_flow_problem depiction Max_flow.svg.
- Maximum_flow_problem isPrimaryTopicOf Maximum_flow_problem.
