Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching.

David R. Karger, Matthew S. Levine

Browse the full STOC paper archive.