1964 search results - page 1 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
CSCLP
2005
Springer
13 years 10 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
JSAT
2008
13 years 4 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
ERCIMDL
2000
Springer
13 years 8 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
JGAA
2000
13 years 4 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
BMVC
1998
13 years 6 months ago
1998
This paper presents an original method using colour histograms for flaw detection in automated industrial inspection. The colour histogram of an image is constructed by mapping th...