278 search results - page 27 / 56 » Two Upper Bounds on the Chromatic Number |
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
FCT
1999
Springer
14 years 23 days ago
1999
Springer
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
DCG
2007
13 years 8 months ago
2007
Given a sphere of any radius r in an n-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider multiple description (MD) coding for the Gaussian source with K descriptions under the symmetric meansquared error (MSE) distortion constraints, and provide an approxim...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...