Sciweavers

136 search results - page 4 / 28
» Crossing and Weighted Crossing Number of Near-Planar Graphs
Sort
View
ALGORITHMICA
2011
12 years 11 months ago
Crossing Numbers of Graphs with Rotation Systems
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...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
COMPGEOM
2006
ACM
13 years 10 months ago
On the maximum number of edges in topological graphs with no four pairwise crossing edges
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a kquasi-...
Eyal Ackerman
GD
2007
Springer
13 years 10 months ago
Crossing Number of Graphs with Rotation Systems
We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, tha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
GD
2009
Springer
13 years 8 months ago
Removing Independently Even Crossings
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...