Andrew V. Goldberg and ACM A.M. Turing Award winner Robert E. Tarjan discuss the maximum-flow, minimum-cut problem in this video accompaniment to "Efficient Maximum Flow Algorithms," their Review Article in the August 2014 Communications of the ACM (http://cacm.acm.org/magazines/2014/8/177011).