24 search results - page 1 / 5 » Exploring the complexity boundary between coloring and list-... |
ENDM
2006
13 years 4 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
SIAMDM
2008
13 years 4 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
ICIP
2005
IEEE
14 years 6 months ago
2005
IEEE
Color signal decomposition method is to decompose the conventional three-primary colors(RGB) into the multiprimary control values of multi-primary display(MPD) under the constraint...
CSL
2004
Springer
13 years 10 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
CVPR
2010
IEEE
14 years 27 days ago
2010
IEEE
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...