Sciweavers

Share
APVIS
2008

Crossing Minimization meets Simultaneous Drawing

8 years 9 months ago
Crossing Minimization meets Simultaneous Drawing
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 crossing number problem, and give an NP-completeness proof and lower and upper bounds for the new problem. Furthermore, we show how existing heuristic and exact algorithms for the traditional problem can be adapted to the new task of simultaneous crossing minimization, and report on a brief experimental study of their implementations.
Markus Chimani, Michael Jünger, Michael Schul
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where APVIS
Authors Markus Chimani, Michael Jünger, Michael Schulz
Comments (0)
books