Sciweavers

157 search results - page 14 / 32
» Frugal Colouring of Graphs
Sort
View
EVOW
2004
Springer
15 years 3 months ago
Binary Merge Model Representation of the Graph Colouring Problem
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...
István Juhos, Attila Tóth, Jano I. v...
DMTCS
2006
66views Mathematics» more  DMTCS 2006»
14 years 10 months ago
On randomly colouring locally sparse graphs
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...
Alan M. Frieze, Juan Vera