Coloring random graphs and maximizing local diversity

Research output: Contribution to journalArticle


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.
Original languageEnglish
Article number057101
Number of pages4
JournalPhysical Review E
Issue number5
Publication statusPublished - 2 Nov 2006

Bibliographical note

Copyright of the American Physical Society


  • graph coloring
  • finite average connectivity
  • algorithms
  • graph colouring

Fingerprint Dive into the research topics of 'Coloring random graphs and maximizing local diversity'. Together they form a unique fingerprint.

  • Cite this