Común · Historia
Maximum flow problem
Computational problem in graph theory
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
-
★
Percolation threshold
Threshold of percolation theory models
-
★★★
NP-completo
Clase de complejidad
-
L★
Lattice problem
Optimization problem in computer science
-
★
Teoría de grafos extremales
-
A★
Algoritmo de Edmonds-Karp
-
3★
3SUM
Problem in computational complexity theory
-
P★
Problema de corte de valores
-
T★★
Teorema de Turán
-
T★★
Teorías de satisfacibilidad módulo
-
S★★
Saint-Venant's problem
Problem in the theory of elasticity about a homogeneous isotropic linear cylindrical material with contact forces applied on both ends
-
S★★
Secondary flow
Relatively minor flow superimposed on the primary flowby inviscid assumptions
-
★★
Teorema de Weierstrass
-
P★
Problema de Stefan
-
B★★
Bloqueo sónico
-
A★
Algoritmo de Emparejamiento de Edmonds
-
M★
Min-max heap
Data structure
-
Q★
Quadratic unconstrained binary optimization
Combinatorial optimization problem
-
M★★
Mixed-integer programming
Mathematical optimization problem with some integer variables and some continuous variables