Search Sciweavers | Sciweavers

157 search results - page 14 / 32

» Frugal Colouring of Graphs

click to vote

EVOW
2004
Springer

148views Artificial Intelligence» more EVOW 2004»

Binary Merge Model Representation of the Graph Colouring Problem

14 years 2 months ago

Download www.vanhemert.co.uk

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...

claim paper

Read More »

click to vote

DMTCS
2006

66views Mathematics» more DMTCS 2006»

On randomly colouring locally sparse graphs

13 years 9 months ago

Download www.math.cmu.edu

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

claim paper

Read More »

click to vote

ACSC
2008
IEEE

100views Theoretical Computer Science» more ACSC 2008»

Experiments in the dynamics of phase coupled oscillators when applied to graph colouring

14 years 3 months ago

Download crpit.com

Sofianto Lee, Raymond Lister

claim paper

Read More »