Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Maximum flow problem
open-in-new
<p>In <a href="/facts/Optimization_(mathematics)/oRn8Iv5I">optimization theory</a>, maximum flow problems involve finding a feasible flow through a <a href="/facts/Flow_network/k0LCoRwD">flow network</a> that obtains the maximum possible flow rate. </p><p>The maximum flow problem can be seen as a special case of more <a href="/facts/Complex_network/6zTa9z4e">complex network</a> flow problems, such as the <a href="/facts/Circulation_problem/u0ymlLF0">circulation problem</a>. The maximum value of an s-t flow (i.e., flow from <a href="/facts/Glossary_of_graph_theory/W0MqKkyE">source</a> s to <a href="/facts/Glossary_of_graph_theory/W0MqKkyE">sink</a> t) is equal to the minimum capacity of an <a href="/facts/Cut_(graph_theory)/1lKf2IIW">s-t cut</a> (i.e., cut severing s from t) in the network, as stated in the <a href="/facts/Max-flow_min-cut_theorem/qrXp2ut7">max-flow min-cut theorem</a>. </p>