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.
Swipe to navigate through the chapters of this book
- An Experimental Study of Crossing Minimization Heuristics
- Springer Berlin Heidelberg
- Sequence number
Neuer Inhalt/© ITandMEDIA