A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Palette-colouring: a belief propagation approach

2011
*
Journal of Statistical Mechanics: Theory and Experiment
*

We consider a variation of the prototype combinatorial-optimisation problem known as graph-colouring. Our optimisation goal is to colour the vertices of a graph with a fixed number of colours, in a way to maximise the number of different colours present in the set of nearest neighbours of each given vertex. This problem, which we pictorially call "palette-colouring", has been recently addressed as a basic example of problem arising in the context of distributed data storage. Even though it has

doi:10.1088/1742-5468/2011/05/p05010
fatcat:tqonr6a7ljga7bk4btexygqpym