170 search results - page 1 / 34 » On Metro-Line Crossing Minimization |
JGAA
2010
13 years 4 months ago
2010
APVIS
2008
13 years 7 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...
ESA
2008
Springer
13 years 7 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 ...
JEA
2010
13 years 11 days ago
2010
An upward drawing of a DAG G is a drawing of G in which all edges are drawn as curves increasing monotonically in the vertical direction. In this paper, we present a new approach f...
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...