scientific article; zbMATH DE number 5504152

zbMATH Open1156.82315MaRDI QIDQ3597150FDOQ3597150

Authors: Alfredo Braunstein, Marc Mézard, Riccardo Zecchina, M. Weigt 

Publication date: 9 February 2009

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cited In (3)

• A review of message passing algorithms in estimation of distribution algorithms
• Why almost all \(k\)-colorable graphs are easy to color
• The resolution complexity of random graph \(k\)-colorability

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597150)