Finding maximum flows in undirected graphs seems easier than bipartite matching
Authors:
- David R. KargerDKDavid R. Karger
- Matthew S. LevineMLMatthew S. Levine
Open Access
- 1 January 1998
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 69-78