A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Message passing for the coloring problem: Gallager meets Alon and Kahale
2007
Discrete Mathematics & Theoretical Computer Science
International audience Message passing algorithms are popular in many combinatorial optimization problems. For example, experimental results show that \emphsurvey propagation (a certain message passing algorithm) is effective in finding proper k-colorings of random graphs in the near-threshold regime. In 1962 Gallager introduced the concept of Low Density Parity Check (LDPC) codes, and suggested a simple decoding algorithm based on message passing. In 1994 Alon and Kahale exhibited a coloring
doi:10.46298/dmtcs.3546
fatcat:vrjcaqrgc5ccfl4gob2vud426y