Maximum flow problem
id:
maximum-flow-problem-187-1734786
title:
Maximum flow problem
text:
In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. 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 is equal to the minimum capacity of an s-t cut in the network, as stated in the max-flow min-cut theorem.
brand slug:
wiki
category slug:
encyclopedia
description:
Computational problem in graph theory
original url:
https://en.wikipedia.org/wiki/Maximum_flow_problem
date created:
2003-12-15T20:15:04Z
date modified:
2024-09-08T15:08:01Z
main entity:
{"identifier":"Q2585642","url":"https://www.wikidata.org/entity/Q2585642"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/2f/Pets_flow.svg","width":512,"height":384}
fields total:
13
integrity:
16