Belief propagation for graph partitioning
Authors:
- Petr ŠulcPŠPetr Šulc
- Lenka ZdeborováLZLenka Zdeborová
- 14 June 2010
- journal article
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 43 (28)
Abstract
No abstract availableKeywords
All Related Versions
This publication has 34 references indexed in Scilit:
- Statistical physics of hard optimization problemsActa Physica Slovaca, 2009
- Gibbs states and the set of solutions of random constraint satisfaction problemsProceedings of the National Academy of Sciences, 2007
- Bounds on the bisection width for random d -regular graphsTheoretical Computer Science, 2007
- Bounds on the max and min bisection of random cubic and random 4-regular graphsTheoretical Computer Science, 2003
- Exact Solutions for Diluted Spin Glasses and Optimization ProblemsPhysical Review Letters, 2001
- Extremal optimization for graph partitioningPhysical Review E, 2001
- The Isoperimetric Number of Random Regular GraphsEuropean Journal of Combinatorics, 1988
- Application of statistical mechanics to NP-complete problems in combinatorial optimisationJournal of Physics A: General Physics, 1986
- Optimization by Simulated AnnealingScience, 1983
- The order parameter for spin glasses: a function on the interval 0-1Journal of Physics A: General Physics, 1980