499 search results - page 6 / 100 » On the Decay of Crossing Numbers |
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...
IACR
2011
12 years 6 months ago
2011
: Random number generator designs are discussed, which utilize oscillatory metastability, induced by switching between two stable states of ring‐connected di...
ALGORITHMICA
2011
13 years 2 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...
GD
2007
Springer
14 years 1 months ago
2007
Springer
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...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
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-...