1363 search results - page 36 / 273 » The road coloring problem |
NIPS
2008
14 years 11 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
DAM
2008
14 years 9 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
ENDM
2000
14 years 9 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
105
click to vote
CAIP
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. We suggest a novel approach to the Color Constancy Problem for multispectral imagery. Our approach is based on a dichromatic illumination model and lters out all spectral...
EJC
2008
14 years 9 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...