An Experimental Study of Crossing Minimization Heuristics

Gutwenger, Carsten and Mutzel, Petra (2004) An Experimental Study of Crossing Minimization Heuristics. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 13-24(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_2).

This is the latest version of this item.

Full text not available from this repository.

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
Additional Information: 10.1007/978-3-540-24595-7_2
Classifications: G Algorithms and Complexity > G.840 Planarization
G Algorithms and Complexity > G.420 Crossings
URI: http://gdea.informatik.uni-koeln.de/id/eprint/407

Available Versions of this Item

Actions (login required)

View Item View Item