836 search results - page 17 / 168 » Orthogonal Colorings of Graphs |
ARSCOM
2008
14 years 12 months ago
2008
DAM
2010
14 years 11 months ago
2010
72
Voted
ICIP
1998
IEEE
16 years 1 months ago
1998
IEEE
ct A color correction matrix is usually used to transform the raw color image obtained from color image sensors to adjust for factors such as variations in illumination and deviati...
RSA
2006
14 years 11 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
120
click to vote
APPROX
2011
Springer
13 years 11 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...