Sign In

Communications of the ACM


Efficient Maximum Flow Algorithms

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 (

Sign In for Full Access
» Forgot Password? » Create an ACM Web Account