# Applications of a planar separator theorem

```@article{Lipton1977ApplicationsOA,
title={Applications of a planar separator theorem},
author={Richard J. Lipton and Robert E. Tarjan},
journal={18th Annual Symposium on Foundations of Computer Science (sfcs 1977)},
year={1977},
pages={162-170}
}```
• Published 1 August 1980
• Mathematics
• 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(√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.
734 Citations

### A Weighted Planar Graph SeparatorMichelangelo

• Mathematics
• 1998
Given a weighted planar graph, we construct a simple separating cycle C whose interior and exterior both weigh at most 2/3 of the total weight. The cycle C uses k jumps across the faces and ordinary

### Finding small simple cycle separators for 2-connected planar graphs.

We show that every 2-connected triangulated planar graph with n vertices has a simple cycle C of length at most 4@@@@n which separates the interior vertices A from the exterior vertices B such that

### On the Parameterized Complexity of Computing Graph Bisections

• Mathematics, Computer Science
WG
• 2013
The Bisection problem asks for a partition of the vertices of a graph into two equally sized sets, while minimizing the cut size. This is the number of edges connecting the two vertex sets. Bisection

### Edge Separators for Planar Graphs and Their Applications

• Mathematics
MFCS
• 1988
It is shown that every planar graph with n vertices and a maximal degree k has an 0(√kn)-edge separator, and any n vertex tree can be divided into two parts of ≤ n / 2 vertices by removing 0(klog n/log k) edges.

### A PTAS for the Minimum Cost 2-edge-Connected Spanning Subgraph in Planar Graphs

• Mathematics
• 2002
Suppose we are given a planar graph G with edge costs and we want to find a 2-edge-connected spanning subgraph of minimum cost. We present a polynomial time approximation scheme (PTAS) for this

### Planar separators and parallel polygon triangulation (preliminary version)

We show how to construct a O(fi)-separator decomposition of a planar graph in O(n) time, and how to triangulate a simple polygon deterministically in parallel in O(log n) time using O(n/ log n)

### Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs

• Mathematics
WALCOM
• 2013
A linear-time algorithm to partition the edges of a planar graph into triangles is proposed and it is shown that it is NP-complete for k-planar graphs, where k ≥ 8.