430 search results - page 34 / 86 » Drawing Graphs with GLEE |
IJFCS
2006
15 years 4 months ago
2006
155
click to vote
JCT
2007
15 years 4 months 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...
144
click to vote
GD
2003
Springer
15 years 9 months ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
139
click to vote
DCG
2008
15 years 4 months ago
2008
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...