Threshold values, stability analysis, and high- asymptotics for the coloring problem on random graphs

F Krząkała, A Pagnani, M Weigt - … Review E—Statistical, Nonlinear, and Soft …, 2004 - APS
We consider the problem of coloring Erdös-Rényi and regular random graphs of finite
connectivity using q colors. It has been studied so far using the cavity approach within the so …

Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs

F Krzakala, A Pagnani, M Weigt - arXiv preprint cond-mat/0403725, 2004 - arxiv.org
We consider the problem of coloring Erdos-Renyi and regular random graphs of finite
connectivity using q colors. It has been studied so far using the cavity approach within the so …

Threshold values, stability analysis, and high-q asymptotics for the coloring problem on random graphs

F Krząkała, A Pagnani, M Weigt - Physical Review E, 2004 - ui.adsabs.harvard.edu
We consider the problem of coloring Erdös-Rényi and regular random graphs of finite
connectivity using q colors. It has been studied so far using the cavity approach within the so …

[引用][C] Threshold values, stability analysis, and high-qasymptotics for the coloring problem on random graphs

F Krząkała, A Pagnani, M Weigt - PHYSICAL REVIEW E …, 2004 - iris.polito.it
Threshold values, stability analysis, and high-qasymptotics for the coloring problem on
random graphs IRIS IRIS Home Sfoglia Macrotipologie & tipologie Autore Titolo Riviste Serie …

[PDF][PDF] Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs

A Pagnani, M Weigt - arXiv preprint cond-mat/0403725 - scholar.archive.org
The graph coloring problem (COL) has been studied both in combinatorics [1] and in
statistical physics [2]. Given a graph, or a lattice, and given a number q of available colors …

Threshold values, stability analysis, and high-q asymptotics for the coloring problem on random graphs

F Krzakała, A Pagnani, M Weigt - Physical review. E …, 2004 - pubmed.ncbi.nlm.nih.gov
We consider the problem of coloring Erdös-Rényi and regular random graphs of finite
connectivity using q colors. It has been studied so far using the cavity approach within the so …

Threshold values, stability analysis, and high-q asymptotics for the coloring problem on random graphs.

F Krzakała, A Pagnani, M Weigt - Physical review. E, Statistical …, 2004 - europepmc.org
We consider the problem of coloring Erdös-Rényi and regular random graphs of finite
connectivity using q colors. It has been studied so far using the cavity approach within the so …

[引用][C] Threshold values, stability analysis, and high-asymptotics for the coloring problem on random graphs

F Krząkała, A Pagnani, M Weigt - Physical Review E, 2004 - cir.nii.ac.jp
Threshold values, stability analysis, and high-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"
display="inline"><mml:mi>q</mml:mi></mml:math>asymptotics for the coloring problem on …

Threshold values, stability analysis, and high-q asymptotics for the coloring problem on random graphs

F Krzakala, A Pagnani, M Weigt - 2004 - publications.goettingen-research …
We consider the problem of coloring Erdos-Renyi and regular random graphs of finite
connectivity using q colors. It has been studied so far using the cavity approach within the so …

[引用][C] Threshold values, stability analysis, and high-q asymptotics for the coloring problem on random graphs

F KRZAKAŁA, A PAGNANI… - Physical review. E …, 2004 - American Physical Society