Planar separator theorem

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2017
024619772017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Alon, Seymour, and Thomas generalized Lipton and Tarjan's planar separator theorem and showed that a $K_h$-minor free graph with… (More)
Is this relevant?
2002
2002
We present I/O-optimal algorithms for several fundamental problems on planar graphs. Our main contribution is an I/O-efficient… (More)
  • figure 1
  • figure 2
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
This paper describes algorithms for answering shortest path queries in digraphs with small separators and, in particular, in… (More)
  • figure 4
Is this relevant?
1988
1988
All graphs have cycle separators. (A single vertex is regarded as a trivial cycle.) In sequential computation, a cycle separator… (More)
Is this relevant?
1987
1987
Lipton and Tarjan [6,7] have shown that their Planar Separator Theorem can be combined with nonserial dynamic programming [10] to… (More)
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1984
Highly Cited
1984
We show that every 2-connected triangulated planar graph with n vertices has a simple cycle C of length at most 4@@@@n which… (More)
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… (More)
  • figure 1
  • figure 2
Is this relevant?
1977
1977
Through the paper Application of A Planar Separator Theorem by RICHARD J. LIPTON and ROBERT TARJAN, we get that any n-vertex… (More)
Is this relevant?