Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
The mining of outliers (or anomaly detection) in large databases continues to remain an active area of research with many… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
The Planar Separator Theorem of Lipton and Tarjan [73] says that in any undirected planar graph G there exists a small separator… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Abstract We show that every 2-connected triangulated planar graph with n vertices has a simple cycle C of length at most 2√2 · n… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Many divide-and-conquer algorithms on graphs are based on finding a small set of vertices or edges whose removal divides the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1980
1980
Summary1.Absolute thresholds to tone and noise bursts were measured for 177 single auditory fibers in the eighth nerves of 8… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1979
Highly Cited
1979
 
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1977
Highly Cited
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… Expand
  • figure 1
  • figure 2
Is this relevant?
1977
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… Expand
  • figure 1
  • figure 2
Is this relevant?