Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Message passing for the coloring problem: Gallager meets Alon and Kahale   Message passing algorithms are popular in many combinatorial optimization
problems. For example, experimental results show that {\em survey 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. Our techniques can be applied to
several other combinatorial optimization problems and networking-related
issues.

29
The categories of this paper are: funct-an
10
The categories of this paper are: q-bio
34
The categories of this paper are: chem-ph
19
The categories of this paper are: eess
36
The categories of this paper are: cmp-lg
14
The categories of this paper are: math-ph
6
The categories of this paper are: astro-ph
35
The categories of this paper are: mtrl-th
13
The categories of this paper are: quant-ph
9
The categories of this paper are: nlin
22
The categories of this paper are: chao-dyn
8
The categories of this paper are: hep-ex
23
The categories of this paper are: solv-int
15
The categories of this paper are: nucl-ex
26
The categories of this paper are: bayes-an
18
The categories of this paper are: econ