266 search results - page 33 / 54 » Chromatic Ramsey numbers |
DM
1998
13 years 7 months ago
1998
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for si...
ALGORITHMICA
2010
13 years 5 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
IMAGING
2001
13 years 8 months ago
2001
In this paper, we present a spherical sampling technique that can be employed to find optimal sensors for trichromatic color applications. The advantage over other optimization te...
ISAAC
2005
Springer
14 years 27 days ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Many high resolution images exhibit chromatic aberration (CA), where the color channels appear shifted. Unfortunately, merely compensating for these shifts is sometimes inadequate...