131 search results - page 3 / 27 » Crossing Number and Weighted Crossing Number of Near-Planar ... |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
RSA
2002
13 years 6 months ago
2002
JGT
2010
13 years 5 months ago
2010
ALGORITHMICA
2011
13 years 1 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
APVIS
2008
13 years 8 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...