Minimum s-t cut of a planar undirected network in o(n log n) time (1981)

by J Reif
Venue:Automata, Languages and Programming