Planar Separator Theorem

Planar Separator Theorem

Edited by 

List price: US$43.99

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 into smaller pieces by removing a small number of vertices. Specifically, the removal of O vertices from an n-vertex graph can partition the graph into disjoint subgraphs each of which has at most 2n/3 vertices. A weaker form of the separator theorem with O vertices in the separator instead of O was originally proven by Ungar, and the form with the tight asymptotic bound on the separator size was first proven by Lipton & more

Product details

  • Paperback | 84 pages
  • 152 x 229 x 5mm | 136g
  • Soph Press
  • United States
  • English
  • black & white illustrations
  • 6136276283
  • 9786136276281