An Experimental Study of Crossing Minimization Heuristics [chapter]

Carsten Gutwenger, Petra Mutzel
2004 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-540-24595-7_2 fatcat:b4vftqnq3bgj3e3us2mbg2fbue