206 search results - page 2 / 42 » Extension of a list coloring problem |
DAM
2006
13 years 5 months ago
2006
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a ...
FOCS
1996
IEEE
13 years 10 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
ICPR
2002
IEEE
14 years 6 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...
ICPR
2010
IEEE
13 years 3 months ago
2010
IEEE
We address here the problem of color constancy and propose a new method to achieve color constancy based on the statistics of images with color cast. Images with color cast have st...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct fro...