Sciweavers

Share
GD
2003
Springer

Fixed Parameter Algorithms for one-sided crossing minimization Revisited

9 years 4 months ago
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
Vida Dujmovic, Henning Fernau, Michael Kaufmann
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where GD
Authors Vida Dujmovic, Henning Fernau, Michael Kaufmann
Comments (0)
books