Sciweavers

431 search results - page 31 / 87
» Bold Graph Drawings
Sort
View
SIAMCOMP
2002
73views more  SIAMCOMP 2002»
13 years 10 months ago
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
Guy Even, Sudipto Guha, Baruch Schieber
GC
2010
Springer
13 years 9 months ago
Drawing Disconnected Graphs on the Klein Bottle
Laurent Beaudou, Antoine Gerbaud, Roland Grappe, F...
JCT
2007
103views more  JCT 2007»
13 years 10 months ago
Geometric drawings of Kn with few crossings
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...
Bernardo M. Ábrego, Silvia Fernández...