@MISC{Staples-moore09networkflows, author = {Al Staples-moore}, title = {NETWORK FLOWS AND THE MAX-FLOW MIN-CUT THEOREM}, year = {2009} }

Share

OpenURL

Abstract

The Max-Flow Min-Cut Theorem is an elementary theorem within the field of network flows, but it has some surprising implications in graph theory. We define network flows, prove the Max-Flow Min-Cut Theorem, and show that this theorem implies Menger’s and König’s Theorems.