Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs.

David R. Karger

Browse the full STOC paper archive.