Común · Historia

Maximum flow problem

Computational problem in graph theory

Texto en inglés

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.

En Wikipedia

Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.

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 (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.

Texto: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: Chin Ho Lee (Public domain) ·

Cartas cercanas

Abrir

…

Toca para cerrar

Confirmación