Applications of a planar separator theorem

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.

[1]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

[2]  Mike Paterson.  Tape Bounds for Time-Bounded Turing Machines , 1972, J. Comput. Syst. Sci..

[3]  Stephen A. Cook,et al.  An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..

[4]  A. George.  Nested Dissection of a Regular Finite Element Mesh , 1973 .

[5]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[6]  P. Erdoes,et al.  On sparse graphs with dense long paths. , 1975 .

[7]  Leslie G. Valiant,et al.  On non-linear lower bounds in computational complexity , 1975, STOC.

[8]  Arnold L. Rosenberg.  Managing Storage for Extendible Arrays , 1975, SIAM J. Comput..

[9]  Ravi Sethi.  Complete Register Allocation Problems , 1975, SIAM J. Comput..

[10]  Michael Ian Shamos,et al.  Geometric complexity , 1975, STOC.

[11]  Robert E. Tarjan,et al.  Space bounds for a game on graphs , 1976, STOC '76.

[12]  Dexter Kozen,et al.  On parallelism in turing machines , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[13]  A. K. Chandra,et al.  Alternation , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[14]  Richard J. Lipton,et al.  Multidimensional Searching Problems , 1976, SIAM J. Comput..

[15]  Arnon Rosenthal.  Nonserial dynamic programming is optimal , 1977, STOC '77.

[16]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[17]  L. Goldschlager.  The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[18]  Leslie G. Valiant,et al.  Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.

[19]  Leslie G. Valiant,et al.  On Time Versus Space , 1977, JACM.

[20]  Douglas H. Norrie,et al.  An introduction to finite element analysis , 1978 .

[21]  Richard J. Lipton,et al.  Preserving average proximity in arrays , 1978, CACM.