Advances in the Planarization Method: Effective Multiple Edge Insertions
The planarization method is the strongest known method to heuristically find good solutions to the general crossing number problem in graphs: starting from a planar subgraph, one iteratively inserts edges, representing crossings via dummy nodes. In the recent years, several improvements both from the practical and the theoretical point of view have been made. We review these advances and conduct an extensive study of the algorithms’ practical implications. Thereby, we present the first implementation of an approximation algorithm for the crossing number problem of general graphs, and compare the obtained results with known exact crossing number solutions.
- 3.Chimani, M.: Computing Crossing Numbers. PhD thesis, TU Dortmund, Germany (2008)Google Scholar
- 4.Chimani, M., Gutwenger, C., Mutzel, P., Wolf, C.: Inserting a vertex into a planar graph. In: Mathiru, C. (ed.) Proc. SODA 2009, pp. 375–383 (2009)Google Scholar
- 6.Chimani, M., Hliněný, P., Mutzel, P.: Vertex insertion approximates the crossing number for apex. Europ. J. Comb. (to appear, 2011)Google Scholar
- 8.Chuzhoy, J., Makarychev, Y., Sidiropoulos, A.: On graph crossing number and edge planarization. In: Proc. SODA 2011, pp. 1050–1069. ACM Press (2011)Google Scholar
- 11.Gutwenger, C.: Application of SPQR-Trees in the Planarization Approach for Drawing Graphs. PhD thesis, TU Dortmund, Germany (2010)Google Scholar
- 18.Ziegler, T.: Crossing Minimization in Automatic Graph Drawing. PhD thesis, Saarland University, Germany (2001)Google Scholar