Counting solution clusters in graph coloring problems using Belief Propagation

Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference

Volumn , Issue , 2009, Pages 873-880

  Kroc, Lukas ^a   Sabharwal, Ashish ^a   Selman, Bart ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

BELIEF PROPAGATION; COLORING PROBLEMS; FACTOR GRAPHS; GRAPH COLORING PROBLEM; GRAPH DENSITY; KNOWLEDGE COMPILATION; NUMBER OF CLUSTERS; PROBLEM INSTANCES; RANDOM COLORING; SOLUTION SPACE;

BELIEF PROPAGATION;

EID: 84858787686     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. D. Achlioptas and F. Ricci-Tersenghi. On the solution-space geometry of random constraint satisfaction problems. In 38th STOC, pages 130-139, Seattle, WA, May 2006. (Pubitemid 44306546)
2. J. Ardelius, E. Aurell, and S. Krishnamurthy. Clustering of solutions in hard satisfiability problems. J. Statistical Mechanics, P10012, 2007.
3. A. Braunstein, R. Mulet, A. Pagnani, M. Weigt, and R. Zecchina. Polynomial iterative algorithms for coloring and analyzing random graphs. Physical Review E, 68:036702, 2003.
4. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Com- puters, 35(8):677-691, 1986.
5. A. Darwiche. New advances in compiling CNF into decomposable negation normal form. In 16th Euro- pean Conf. on AI, pages 328-332, Valencia, Spain, Aug. 2004.
6. A. Darwiche. Decomposable negation normal form. J. ACM, 48(4):608-647, 2001.
7. A. Hartmann, A. Mann, and W. Radenback. Clusters and solution landscapes for vertex-cover and SAT problems. In Workshop on Physics of Distributed Systems, Stockholm, Sweden, May 2008.
8. L. Kroc, A. Sabharwal, and B. Selman. Counting solution clusters of combinatorial problems using belief propagation, 2008. (in preparation).
9. F. Krzakala, A. Montanari, F. Ricci-Tersenghi, G. Semerjian, and L. Zdeborova. Gibbs states and the set of solutions of random constraint satisfaction problems. PNAS, 104(25):10318-10323, June 2007. (Pubitemid 47185663)
10. D. Mackay, J. Yedidia, W. Freeman, and Y. Weiss. A conversation about the Bethe free energy and sum-product, 2001. URL citeseer.ist.psu.edu/ mackay01conversation.html.
11. M. Mézard, G. Parisi, and R. Zecchina. Analytic and algorithmic solution of random satisfiability problems. Science, 297(5582):812-815, 2002. (Pubitemid 34839626)
12. J. S. Yedidia, W. T. Freeman, and Y. Weiss. Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory, 51(7):2282-2312, 2005. (Pubitemid 41136394)