Maximum flow problem: Optimization (mathematics), Flow network, Cut (graph theory), Max-flow min-cut theorem, Ford-Fulkerson algorithm - Tapa blanda

Sinopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.

"Sinopsis" puede pertenecer a otra edición de este libro.