217 search results - page 16 / 44 » A new upper bound on the cyclic chromatic number |
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
JGAA
2006
13 years 7 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...