An Experimental Study of Crossing Minimization Heuristics

Gutwenger, Carsten and Mutzel, Petra (2003) An Experimental Study of Crossing Minimization Heuristics. In: Graph Drawing 2003, 2003 . (In Press)

WarningThere is a more recent version of this item available.
[img] Other - Registered users only
Download (105kB)

Abstract

We present an extensive experimental study of heuristics for crossing minimization. The heuristics are based on the planarization approach, so far the most successful framework for crossing minimization. We study the effects of various methods for computing a maximal planar subgraph and for edge re-insertion including post-processing and randomization.

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.420 Crossings
M Methods > M.700 Planarization-based
URI: http://gdea.informatik.uni-koeln.de/id/eprint/28

Available Versions of this Item

Actions (login required)

View Item View Item