Sciweavers

GD
2005
Springer

Non-planar Core Reduction of Graphs

14 years 5 months ago
Non-planar Core Reduction of Graphs
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness. The core reduction is based on the decomposition of a graph into its triconnected components and can be computed in linear time. It has applications in heuristic and exact optimization algorithms for the planarity measures mentioned above. Experimental results show that this strategy yields a reduction to 2/3 in average for a widely used benchmark set of graphs.
Carsten Gutwenger, Markus Chimani
Added 29 Jun 2010
Updated 29 Jun 2010
Type Conference
Year 2005
Where GD
Authors Carsten Gutwenger, Markus Chimani
Comments (0)