Sciweavers

1749 search results - page 13 / 350
» Conditional colorings of graphs
Sort
View
AUSAI
2004
Springer
14 years 1 months ago
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
Songshan Guo, Ying Kong, Andrew Lim, Fan Wang
ECCV
2008
Springer
14 years 10 months ago
Automatic Image Colorization Via Multimodal Predictions
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
Bernhard Schölkopf, Guillaume Charpiat, Matth...
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
13 years 10 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
SIAMDM
2008
190views more  SIAMDM 2008»
13 years 8 months ago
On the Complexity of Ordered Colorings
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...
Arvind Gupta, Jan van den Heuvel, Ján Manuc...
DAM
2010
132views more  DAM 2010»
13 years 8 months ago
Homomorphisms of 2-edge-colored graphs
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, ...