Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

DCG
2006

favoriteEmaildiscussreport

96views more DCG 2006»

k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn

13 years 7 months ago

k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn

Download www.ifisica.uaslp.mx

We use circular sequences to give an improved lower bound on the minimum number of ( k)

József Balogh, Gelasio Salazar

Real-time Traffic

Circular Sequences | DCG 2006 | General Position | Lower Bound |

claim paper

Related Content

» On the rectilinear crossing number of complete graphs

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DCG
Authors	József Balogh, Gelasio Salazar

Comments (0)