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

David R. Karger Matthew S. Levine

Published in: STOC (1998)

Keyphrases

bipartite matching
undirected graph
strongly connected
directed acyclic graph
directed graph
approximation algorithms
maximum weight
connected components
graph structure
multicommodity flow
data structure
complex networks
minimum cost flow