Coloring random graphs and maximizing local diversity

Bounkong, S., van Mourik, Jort and Saad, David (2006). Coloring random graphs and maximizing local diversity. Physical Review E, 74 (5),


We study a variation of the graph coloring problem on random graphs of finite average connectivity. Given the number of colors, we aim to maximize the number of different colors at neighboring vertices (i.e. one edge distance) of any vertex. Two efficient algorithms, belief propagation and Walksat are adapted to carry out this task. We present experimental results based on two types of random graphs for different system sizes and identify the critical value of the connectivity for the algorithms to find a perfect solution. The problem and the suggested algorithms have practical relevance since various applications, such as distributed storage, can be mapped onto this problem.

Publication DOI:
Divisions: Engineering & Applied Sciences > Mathematics
Engineering & Applied Sciences > Non-linearity and complexity research group
Related URLs:
Additional Information: Copyright of the American Physical Society
Uncontrolled Keywords: graph coloring,finite average connectivity,algorithms,graph colouring
Published Date: 2006-11-02



Export / Share Citation


Additional statistics for this record