High Quality Content by WIKIPEDIA articles! In optimization theory, the maximum flow problem is to find 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 is equal to the minimum capacity of an s-t cut in the network, as stated in the max-flow min-cut theorem.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.