431 search results - page 31 / 87 » Bold Graph Drawings |
92
Voted
SIAMCOMP
2002
15 years 7 days ago
2002
73
Voted
GC
2010
Springer
14 years 11 months ago
2010
Springer
69
Voted
IPL
2010
14 years 11 months ago
2010
80
Voted
TCS
2010
14 years 11 months ago
2010
111
Voted
JCT
2007
15 years 14 days ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...