136 search results - page 3 / 28 » Crossing and Weighted Crossing Number of Near-Planar Graphs |
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...
MFCS
2004
Springer
14 years 11 days ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
SIAMCOMP
2000
13 years 6 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
CORR
2010
Springer
13 years 7 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
