570 search results - page 16 / 114 » Edge Coloring with Delays |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
DAM
2007
14 years 11 months ago
2007
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
HAIS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Color constancy and chromatic edge detection are fundamental problems in artificial vision. In this paper1 we present a way to provide a visualization of color constancy...
COMGEO
2008
ACM
14 years 11 months ago
2008
ACM
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
ECCV
1998
Springer
16 years 1 months ago
1998
Springer
Abstract. A simplified color image formation model is used to construct an algorithm for image reconstruction from CCD sensors samples. The proposed method involves two successive ...