Sciweavers

5052 search results - page 1 / 1011
» On the Complexity of Ordered Colorings
Sort
View
SIAMDM
2008
190views more  SIAMDM 2008»
13 years 4 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...
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
13 years 8 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth
MLQ
2007
108views more  MLQ 2007»
13 years 4 months ago
Coloring linear orders with Rado's partial order
Let R be the preorder of embeddability between countable linear orders colored with elements of Rado’s partial order (a standard example of a wqo which is not a bqo). We show tha...
Riccardo Camerlo, Alberto Marcone
ICIP
2003
IEEE
14 years 6 months ago
Color segmentation by ordered mergings
The paper deals with the use of the various color pieces of information for segmenting color images and sequences with mathematical morphology operators. It is divided in four par...
Jesús Angulo, Jean Serra
PR
2002
129views more  PR 2002»
13 years 4 months ago
Text extraction in complex color documents
Text extraction in mixed-type documents is a pre-processing and necessary stage for many document applications. In mixed-type color documents, text, drawings and graphics appear w...
Charalambos Strouthopoulos, Nikos Papamarkos, Anto...