# Applications of a planar separator theorem

@article{Lipton1977ApplicationsOA,
title={Applications of a planar separator theorem},
author={R. Lipton and R. Tarjan},
journal={18th Annual Symposium on Foundations of Computer Science (sfcs 1977)},
year={1977},
pages={162-170}
}
• Published 1977
• Mathematics, Computer Science
• 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.
754 Citations

#### Figures and Topics from this paper

An Improved Algorithm for the Planar 3-Cut Problem
• Xin He
• Mathematics, Computer Science
• J. Algorithms
• 1991
This paper presents an O ( n log n ) algorithm for finding a minimum 3-cut in planar graphs and improves the best previously known algorithm for the problem by an O( n logn) factor. Expand
Edge Separators for Graphs of Bounded Genus with Applications
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 1993
We prove that every n-vertex graph of genus g and maximal degree k has an edge separator of size O(√gkn). The upper bound is best possible to within a constant factor. This extends known results onExpand
On cleaving a planar graph
This work first shows that the removal of 4√ n / ϵ vertices from an n -vertex planar graph with non-negative vertex weights summing to no more than 1 is sufficient to cleave or recursively separate it into components of weight no less than a given ϵ, and derives worst-case bounds on the number of vertices necessary. Expand
Finding Short Cycles in Planar Graphs Using Separators
• D. Richards
• Mathematics, Computer Science
• J. Algorithms
• 1986
This work presents O(n log n) time algorithms for detecting both a C5 or a C6 in a planar graph that uses aPlanar separator that is a small simple cycle. Expand
A Weighted Planar Graph SeparatorMichelangelo
• 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 ordinaryExpand
On approximating a vertex cover for planar graphs
• Mathematics, Computer Science
• STOC '82
• 1982
The approximation problem for vertex cover of n-vertex planar graphs is treated and two results are presented: a linear time approximation algorithm and an O(n log n) time approximation scheme. Expand
Finding small simple cycle separators for 2-connected planar graphs.
• G. Miller
• Mathematics, Computer Science
• STOC '84
• 1984
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 thatExpand
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. BisectionExpand
Edge Separators for Planar Graphs and Their Applications
• Computer Science, 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. Expand
A PTAS for the Minimum Cost 2-edge-Connected Spanning Subgraph in Planar Graphs
• 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 thisExpand

#### References

SHOWING 1-10 OF 26 REFERENCES
A Separator Theorem for Planar Graphs
• Mathematics
• 1977
Let G be any n-vertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains moreExpand
Space bounds for a game on graphs
• Mathematics, Computer Science
• STOC '76
• 1976
It is shown that for each graph withn vertices and maximum in-degreed, there is a pebbling strategy which requires at mostc(d) n/logn pebbles, and this bound is tight to within a constant factor. Expand
On non-linear lower bounds in computational complexity
It is shown that the graph of any algorithm for any one of a number of arithmetic problems (e.g. polynomial multiplication, discrete Fourier transforms, matrix multiplication) must have properties closely related to concentration networks. Expand
Geometric complexity
An effort is made to recast classical theorems into a useful computational form and analogies are developed between constructibility questions in Euclidean geometry and computability questions in modern computational complexity. Expand
On sparse graphs with dense long paths.
• Mathematics
• 1975
The following problem was raised by H.-J. Stoss in connection with certain questions related to the complexity of Boolean functions. An acyclic directed graph G is said to have property P(m,n) if forExpand
The monotone and planar circuit value problems are log space complete for P
It is shown that Ladner's simulation of Turing mac]hines by boolean circuits seems to require an "adequate" set of gates, such as AND and NOT, but the same simulation is possible with monotone circuits using AND and OR gates only. Expand
Graph-Theoretic Arguments in Low-Level Complexity
One approach to understanding complexity issues for certain easily computable natural functions is surveyed, and the notion of rigidity does offer for the first time a reduction of relevant computational questions to noncomputional properties. Expand
Multidimensional Searching Problems
• Mathematics, Computer Science
• SIAM J. Comput.
• 1976
Classic binary search is extended to multidimensional search problems. This extension yields efficient algorithms for a number of tasks such as a secondary searching problem of Knuth, region locationExpand
Preserving average proximity in arrays
• Mathematics, Computer Science
• CACM
• 1978
The combinatorial problem of storing arrays as various kinds of list structures is examined, and an elementary proof that arrays cannot be stored as linear lists with bounded loss of proximity is presented. Expand
Nested Dissection of a Regular Finite Element Mesh
Let M be a mesh consisting of $n^2$ squares called elements, formed by subdividing the unit square $(0,1) \times (0,1)$ into $n^2$ small squares of side ${1 / h}$, and having a node at each of theExpand