60 search results - page 4 / 12 » On Packing Colorings of Distance Graphs |
JCB
2006
13 years 7 months ago
2006
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
Color and color neighborhood statistics have been used extensively in image matching and retrieval. However, the effective incorporation of color layout information remains a chal...
JCST
2008
13 years 7 months ago
2008
d Abstract) Tiziana Calamoneri 1 , Saverio Caminiti 2 , and Rossella Petreschi 3 Dipartimento di Informatica Universit`a degli Studi di Roma "La Sapienza" Via Salaria 113...
APPROX
2011
Springer
12 years 7 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...