"Graphs." . . "Computations." . . "Circuits." . . . . "Algorithms." . . . . . . . . . . "Applications of a Planar Separator Theorem"@en . . . . "Applications of a planar separator theorem"@en . . "Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(square root of n) vertices. This separator theorem, in combination with a divide-and-conquer strategy, leads to many new complexity results for planar graph problems. This paper describes some of these results. (Author)."@en . . . "Applications of a planar separator theorem" . . . . . . . . . . . . . . . . . "Theorems." . . "Computer applications." . . "Theoretical Mathematics." . . "Problem solving." . . "Separators." . . "Planar structures." . . "Dynamic programming." . . "STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE." . .