2 search results - page 1 / 1 » k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing ... |
DCG
2006
13 years 5 months ago
2006
We use circular sequences to give an improved lower bound on the minimum number of ( k)
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...