650 search results - page 1 / 130 » An Improved Algorithm for the Metro-line Crossing Minimizati... |
GD
2009
Springer
13 years 8 months ago
2009
Springer
ESA
2008
Springer
13 years 6 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
GD
2003
Springer
13 years 10 months ago
2003
Springer
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 ...
APVIS
2008
13 years 6 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
GD
2008
Springer
13 years 5 months ago
2008
Springer
