Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,467,697 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
1-planar graph
Ackermann function
Approximation algorithm
Binary tree
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Vineyards in Terraced Landscapes: New Opportunities from Lidar Data
P. Tarolli
,
G. Sofia
,
Simone Calligaro
,
M. Prosdocimi
,
F. Preti
,
G. Dalla Fontana
2015
Corpus ID: 55360852
Vineyard landscapes are a relevant part of the European culture, and several authors concluded that they are the agricultural…
Expand
Highly Cited
2012
Highly Cited
2012
Multiobjective Optimal Location of FACTS Shunt-Series Controllers for Power System Operation Planning
A. L. Ara
,
Ahad Kazemi
,
S. Niaki
IEEE Transactions on Power Delivery
2012
Corpus ID: 13420343
This paper develops appropriate models of flexible ac transmission systems (FACTS) shunt-series controllers for multiobjective…
Expand
Highly Cited
2006
Highly Cited
2006
A Geometric Preferential Attachment Model of Networks
A. Flaxman
,
A. Frieze
,
Juan C. Vera
Internet Mathematics
2006
Corpus ID: 1723886
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The…
Expand
2001
2001
Application of A Planar Separator Theorem
Li Yan
2001
Corpus ID: 11555171
Through the paper Application of A Planar Separator Theorem by RICHARD J. LIPTON and ROBERT TARJAN, we get that any n-vertex…
Expand
Highly Cited
1997
Highly Cited
1997
Separators for sphere-packings and nearest neighbor graphs
G. Miller
,
S. Teng
,
W. Thurston
,
S. Vavasis
JACM
1997
Corpus ID: 17331739
A collection of <italic>n</italic> balls in <italic>d</italic> dimensions forms a <italic>k</italic>-ply system if no point in…
Expand
Highly Cited
1994
Highly Cited
1994
The program structure tree: computing control regions in linear time
Richard Johnson
,
David Pearson
,
K. Pingali
ACM-SIGPLAN Symposium on Programming Language…
1994
Corpus ID: 5753565
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single…
Expand
1992
1992
The Planar Separator Theorem
D. Kozen
1992
Corpus ID: 117242165
The Planar Separator Theorem of Lipton and Tarjan [73] says that in any undirected planar graph G there exists a small separator…
Expand
Review
1990
Review
1990
Object asymmetries in comparative Bantu syntax
J. Bresnan
,
Lioba J. Moshi
1990
Corpus ID: 56073527
ing away from the effects of the relative animacy of passivized subject and object markers, we see that object markers can…
Expand
Highly Cited
1984
Highly Cited
1984
A Separator Theorem for Graphs of Bounded Genus
J. Gilbert
,
J. Hutchinson
,
R. Tarjan
J. Algorithms
1984
Corpus ID: 32048587
Highly Cited
1977
Highly Cited
1977
Applications of a planar separator theorem
R. Lipton
,
R. Tarjan
18th Annual Symposium on Foundations of Computer…
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE