Skip to search formSkip to main contentSkip to account menu

Planar separator theorem

Known as: PST, Separator 
In graph theory, the planar separator theorem is a form of isoperimetric inequality for planar graphs, that states that any planar graph can be split… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Vineyard landscapes are a relevant part of the European culture, and several authors concluded that they are the agricultural… 
Highly Cited
2012
Highly Cited
2012
This paper develops appropriate models of flexible ac transmission systems (FACTS) shunt-series controllers for multiobjective… 
Highly Cited
2006
Highly Cited
2006
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The… 
2001
2001
Through the paper Application of A Planar Separator Theorem by RICHARD J. LIPTON and ROBERT TARJAN, we get that any n-vertex… 
Highly Cited
1997
Highly Cited
1997
A collection of <italic>n</italic> balls in <italic>d</italic> dimensions forms a <italic>k</italic>-ply system if no point in… 
Highly Cited
1994
Highly Cited
1994
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single… 
1992
1992
The Planar Separator Theorem of Lipton and Tarjan [73] says that in any undirected planar graph G there exists a small separator… 
Review
1990
Review
1990
ing away from the effects of the relative animacy of passivized subject and object markers, we see that object markers can… 
Highly Cited
1984
Highly Cited
1984
Highly Cited
1977
Highly Cited
1977
  • R. LiptonR. Tarjan
  • 1977
  • Corpus ID: 12961628
Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(√n…