Applications of a planar separator theorem

  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)},
  • R. Lipton, R. Tarjan
  • 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. 

Figures from this paper

An Improved Algorithm for the Planar 3-Cut Problem

  • Xin He
  • Computer Science, Mathematics
    J. Algorithms
  • 1991

On cleaving a planar graph

A Weighted Planar Graph SeparatorMichelangelo

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

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

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

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

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.



A Separator Theorem for Planar Graphs

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 more

Space bounds for a game on graphs

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.

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.

Geometric complexity

  • M. Shamos
  • Mathematics, Computer Science
  • 1975
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.

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.

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.

Multidimensional Searching Problems

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 location

Preserving average proximity in arrays

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.

Nested Dissection of a Regular Finite Element Mesh

This paper presents an unusual numbering of the mesh (unknowns) and shows that if the authors avoid operating on zeros, the $LDL^T $ factorization of A can be computed using the same standard algorithm in $O(n^3 )$ arithmetic operations.