Sciweavers

136 search results - page 3 / 28
» Crossing and Weighted Crossing Number of Near-Planar Graphs
Sort
View
APVIS
2008
13 years 4 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 crossin...
Markus Chimani, Michael Jünger, Michael Schul...
MFCS
2004
Springer
13 years 8 months ago
Crossing Number Is Hard for Cubic Graphs
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...
Petr Hlinený
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
13 years 2 months ago
On Bipartite Drawings and the Linear Arrangement Problem
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 ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 2 months ago
On Graph Crossing Number and Edge Planarization
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 ...
Julia Chuzhoy, Yury Makarychev, Anastasios Sidirop...
RSA
2002
49views more  RSA 2002»
13 years 2 months ago
Crossing numbers of random graphs
Joel Spencer, Géza Tóth