Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time.

John H. Reif

Browse the full ICALP paper archive.