1749 search results - page 40 / 350 » Conditional colorings of graphs |
ALGORITHMICA
2010
13 years 6 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...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
EMMCVPR
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we consider the problem of color restoration using statistical priors. This is applied to color recovery for underwater images, using an energy minimization formulat...
IPL
2008
13 years 8 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
ACCV
1998
Springer
14 years 23 days ago
1998
Springer
Abstract. This paper studies a statistical skin-color model and its adaptation. It is revealed that 1 human skin colors cluster in a small region in a color space; 2 the variance o...