Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs

David R. Karger. Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs. In STOC. pages 240-249, 1997. [doi]

Abstract

Abstract is missing.