584 search results - page 5 / 117 » On the Number of Halving Planes |
GD
2005
Springer
14 years 26 days ago
2005
Springer
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...
JCT
2007
13 years 7 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...
COMGEO
2012
ACM
12 years 3 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
RECOMB
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. Whole genome doubling (WGD), a frequent occurrence during the evolution of the angiopsperms, complicates ancestral gene order reconstruction due to the multiplicity of so...
DCG
2008
13 years 7 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...