Message passing for the coloring problem: Gallager meets Alon and Kahale - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2007

Message passing for the coloring problem: Gallager meets Alon and Kahale

Abstract

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 algorithm and proved its usefulness for finding a k-coloring of graphs drawn from a certain planted-solution distribution over k-colorable graphs. In this work we show an interpretation of Alon and Kahale's coloring algorithm in light of Gallager's decoding algorithm, thus showing a connection between the two problems - coloring and decoding. This also provides a rigorous evidence for the usefulness of the message passing paradigm for the graph coloring problem.
Fichier principal
Vignette du fichier
dmAH0115.pdf (226.65 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184794 , version 1 (17-08-2015)

Identifiers

Cite

Sonny Ben-Shimon, Dan Vilenchik. Message passing for the coloring problem: Gallager meets Alon and Kahale. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.235-246, ⟨10.46298/dmtcs.3546⟩. ⟨hal-01184794⟩

Collections

INSMI TDS-MACS
52 View
450 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More