Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time.

Jakub Lacki, Piotr Sankowski

Browse the full ESA paper archive.