246 search results - page 1 / 50 » Distance Coloring |
ICISP
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. When the amount of color data is reduced in a lossy compression scheme, the question of the use of a color distance is crucial, since no total order exists in IRn
ESA
2007
Springer
13 years 11 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
GC
2008
Springer
13 years 4 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
PRL
2008
13 years 4 months ago
2008
Color matching in Content-Based Image Retrieval is done using a color space and measuring distances between colors. Such an approach yields nonintuitive results for the user. We i...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...