A Separator Theorem for Planar Graphs
Copyright policy )A Separator Theorem for Planar Graphs
Let G be any n-vertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than ${2n / 3}$ vertices, and C contains no more than $2\sqrt 2 \sqrt n $ vertices. We exhibit an algorithm which finds such a partition A, B, C in $O( n )$ time.
sparse systems of linear equations, Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, planar graph, pebbling, divide-and-conquer, Software, source code, etc. for problems pertaining to combinatorics, partition, Planar graphs; geometric and topological aspects of graph theory, post office problem
sparse systems of linear equations, Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, planar graph, pebbling, divide-and-conquer, Software, source code, etc. for problems pertaining to combinatorics, partition, Planar graphs; geometric and topological aspects of graph theory, post office problem
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).797 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 1% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 0.01% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!