Fixed Parameter Algorithms for one-sided crossing minimization Revisited

We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering approach. Moreover, we improve on the search tree algo

• Type: Conference
• Year: 2003
• Where: GD
• Authors: Vida Dujmovic, Henning Fernau, Michael Kaufmann
• Keywords: Crossing Minimization Problem, GD 2003, Small Problem Kernel, Sugiyama Layering Approach