1984 search results - page 12 / 397 » The colourful feasibility problem |
EVOW
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
WG
2010
Springer
13 years 8 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
CVPR
2004
IEEE
14 years 1 months ago
2004
IEEE
Multimedia retrieval is going to play an increasingly important role in the future. Since the availability of digital media seems ever rising, not only the retrieval performance i...
SIAMJO
2008
13 years 9 months ago
2008
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
CPAIOR
2009
Springer
14 years 4 months ago
2009
Springer
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...