Faster algorithms for finding small edge cuts in planar graphs
Satish B. Rao · 1992
In this paper, we consider partitioning a planar graph by removing either nodes or edges. In particular, we consider a cut to be either a set of nodes or edges whose removal divides the graph into two pieces.