1984 search results - page 2 / 397 » The colourful feasibility problem |
AAIM
2007
Springer
13 years 12 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
IJON
2006
13 years 5 months ago
2006
Digital colour image enhancement using a homomorphic filter provides good dynamic range compression, but it fails in colour rendition. In this letter, we propose to perform natura...
APPROX
1998
Springer
13 years 10 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
ACCV
2007
Springer
13 years 12 months ago
2007
Springer
The problem of colour image segmentation is investigated in the context of mathematical morphology. Morphological operators are extended to colour images by means of a lexicographi...
CYS
2000
13 years 5 months ago
2000