A deterministic near-linear time algorithm for finding minimum cuts in planar graphs.

Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai

Browse the full SODA paper archive.