164 search results - page 6 / 33 » Balanced Interval Coloring |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
IMAGING
2001
14 years 11 months ago
2001