WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/58314630

Applications of a Planar Separator Theorem

Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(square root of n) vertices. This separator theorem, in combination with a divide-and-conquer strategy, leads to many new complexity results for planar graph problems. This paper describes some of these results. (Author).

Open All Close All

type

about

contributor

creator

description

http://schema.org/description

  • "Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(square root of n) vertices. This separator theorem, in combination with a divide-and-conquer strategy, leads to many new complexity results for planar graph problems. This paper describes some of these results. (Author)."@en

name

http://schema.org/name

  • "Applications of a Planar Separator Theorem"@en
  • "Applications of a planar separator theorem"
  • "Applications of a planar separator theorem"@en

workExample