Can A Maximum Flow be Computed on o(nm) Time?

Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn. Can A Maximum Flow be Computed on o(nm) Time?. In Mike Paterson, editor, Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, July 16-20, 1990, Proceedings. Volume 443 of Lecture Notes in Computer Science, pages 235-248, Springer, 1990.

Abstract

Abstract is missing.