15 search results - page 1 / 3 » Binary Merge Model Representation of the Graph Colouring Pro... |
EVOW
2004
Springer
13 years 10 months ago
2004
Springer
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
EVOW
2005
Springer
13 years 11 months ago
2005
Springer
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...
ICPR
2008
IEEE
13 years 12 months ago
2008
IEEE
In this paper, a colour text/graphics segmentation is proposed. Firstly, it takes advantage of colour properties by computing a relevant hybrid colour model. Then an edge detectio...
EVOW
2006
Springer
13 years 9 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...
ICIP
2009
IEEE
14 years 6 months ago
2009
IEEE
This paper presents an algorithm for tree-based representation of single images and its applications to segmentation and filtering with depth. In a our recent work, we have addres...