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.
- 1.Chimani, M., Gutwenger, C.: On the minimum cut of planarizations. Technical report, University of Dortmund, Germany (2005)Google Scholar