5052 search results - page 16 / 1011 » On the Complexity of Ordered Colorings |
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
PICS
2000
13 years 9 months ago
2000
Color appearance models provide a powerful tool for achieving a viewing condition independent color representation. However, current color appearance models such as CIECAM97s 1,2 ...
ESA
2007
Springer
14 years 2 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...
CGO
2007
IEEE
14 years 2 months ago
2007
IEEE
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
WG
2001
Springer
14 years 26 days ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...