Approximate max-flow min-cut theorem

In graph theory, approximate max-flow min-cut theorems concern the relationship between the maximum flow rate (max-flow) and the minimum cut (min-cut) in multi-commodity flow problems. The classic max-flow min-cut theorem states that for networks with a single type of flow (single-commodity flows), the maximum possible flow from source to sink is precisely equal to the capacity of the smallest cut.

Source: Wikipedia — Approximate max-flow min-cut theorem (CC BY-SA 4.0)

Approximate max-flow min-cut theorem

In graph theory, approximate max-flow min-cut theorems concern the relationship between the maximum flow rate (max-flow) and the minimum cut (min-cut) in multi-commodity flow problems. The classic max-flow min-cut theorem states that for networks with a single type of flow (single-commodity flows), the maximum possible flow from source to sink is precisely equal to the capacity of the smallest cut.

This neuron ends here.

Source: Wikipedia "Approximate max-flow min-cut theorem" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy