Back to Discover
🔢

Max-flow min-cut theorem

math Maturity 11-13

Think about water in pipes.

Max flow.svg
Max flow.svg
The water flows from one place to another. Some pipes are small. Some pipes are big. A small pipe can slow things down. This is called a bottleneck. The most water you can send is set by the smallest part. Can you find a bottleneck?

51 words
🖼️ Images & Media (3)
File:Max_flow.svg
Max_flow.svg
File:Max-flow min-cut project-selection.svg
Max-flow min-cut project-selection.svg
File:Image segmentation.jpg
Image segmentation.jpg
Up Next
🔢
Flow network
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Flow network 0% Maximum flow problem 0% Minimum-cost flow problem 0% Ford–Fulkerson algorithm 0% Connectivity (graph theory) 0% Duality (optimization) 0%

🔬 Go deeper

More advanced topics to explore

Minimum-cost flow problem Duality (optimization) Kőnig's theorem (graph theory) Maximum-cardinality matching

🪜 Step back

Simpler topics to build understanding

Flow network Maximum flow problem Ford–Fulkerson algorithm Connectivity (graph theory)
📚 Content adapted from Wikipedia | Readability: FK 11.5 | Vital Level 5