396 search results - page 7 / 80 » Crossing Numbers |
144
Voted
ESA
2008
Springer
15 years 6 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
136
click to vote
DCG
2006
15 years 5 months ago
2006
We use circular sequences to give an improved lower bound on the minimum number of ( k)
147
Voted
ENDM
2008
15 years 5 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
109
Voted
ICEIS
2006
IEEE
15 years 11 months ago
2006
IEEE
