Max flows in O(nm) time, or better

James B. Orlin. Max flows in O(nm) time, or better. In Dan Boneh, Tim Roughgarden, Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. pages 765-774, ACM, 2013. [doi]

Abstract

Abstract is missing.