Planar separators and the Euclidean norm

Abstract

In this paper we show that every 2-connected embedded planar graph with faces of sizes d ₁.....d _f has a simple cycle separator of size 1.58 $\sqrt {d_1^2 + \cdots + d_f^2 }$and we give an almost linear time algorithm for finding these separators, O(no(n,n)). We show that the new upper bound expressed as a function of ‖G‖=$\sqrt {d_1^2 + \cdots + d_f^2 }$is no larger, up to a constant factor than previous bounds that where expressed in terms of $\sqrt {d \cdot v}$where d is the maximum face size and ν is the number of vertices and is much smaller for many graphs. The algorithms developed are simpler than earlier algorithms in that they work directly with the planar graph and its dual. They need not construct or work with the face-incidence graph as in [Mil86, GM87, GM].

This work was supported in part by grant number N00014-88-K-0623

This work was supported in part by National Science Foundation grant DCR-8713489.