EaG09 F. Eaton and Z. Ghahramani (2009): "Choosing a Variable to Clamp", Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS 2009) 5:145-152, http://jmlr.csail.mit.edu/proceedings/papers/v5/eaton09a/eaton09a.pdf

EMK06 G. Elidan and I. McGraw and D. Koller (2006): "Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing", Proceedings of the 22nd Annual Conference on Uncertainty in Artificial Intelligence (UAI-06), http://uai.sis.pitt.edu/papers/06/UAI2006_0091.pdf

HAK03 T. Heskes and C. A. Albers and H. J. Kappen (2003): "Approximate Inference and Constrained Optimization", Proceedings of the 19th Annual Conference on Uncertainty in Artificial Intelligence (UAI-03) pp. 313-320, http://www.snn.ru.nl/reports/Heskes.uai2003.ps.gz

KFL01 F. R. Kschischang and B. J. Frey and H.-A. Loeliger (2001): "Factor Graphs and the Sum-Product Algorithm", IEEE Transactions on Information Theory 47(2):498-519, http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=910572

KoF09 D. Koller and N. Friedman (2009): Probabilistic Graphical Models - Principles and Techniques, The MIT Press, Cambridge, Massachusetts, London, England.

Min05 T. Minka (2005): "Divergence measures and message passing", MicroSoft Research Technical Report MSR-TR-2005-173, http://research.microsoft.com/en-us/um/people/minka/papers/message-passing/minka-divergence.pdf

MiQ04 T. Minka and Y. Qi (2004): "Tree-structured Approximations by Expectation Propagation", Advances in Neural Information Processing Systems (NIPS) 16, http://books.nips.cc/papers/files/nips16/NIPS2003_AA25.pdf

MoK07 J. M. Mooij and H. J. Kappen (2007): "Loop Corrections for Approximate Inference on Factor Graphs", Journal of Machine Learning Research 8:1113-1143, http://www.jmlr.org/papers/volume8/mooij07a/mooij07a.pdf

MoK07b J. M. Mooij and H. J. Kappen (2007): "Sufficient Conditions for Convergence of the Sum-Product Algorithm", IEEE Transactions on Information Theory 53(12):4422-4437, http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4385778

Moo08 J. M. Mooij (2008): "Understanding and Improving Belief Propagation", Ph.D. Thesis Radboud University Nijmegen http://webdoc.ubn.ru.nl/mono/m/mooij_j/undeanimb.pdf

MoR05 A. Montanari and T. Rizzo (2005): "How to Compute Loop Corrections to the Bethe Approximation", Journal of Statistical Mechanics: Theory and Experiment 2005(10)-P10011, http://stacks.iop.org/1742-5468/2005/P10011

RYG12 S. Ravanbakhsh, C.-N. Yu, R. Greiner (2012): "A Generalized Loop Correction Method for Approximate Inference in Graphical Models", 29th International Conference on Machine Learning (ICML 2012), http://www.icml.cc/2012/papers/#paper-304

StW99 A. Steger and N. C. Wormald (1999): "Generating Random Regular Graphs Quickly", Combinatorics, Probability and Computing Vol 8, Issue 4, pp. 377-396, http://www.math.uwaterloo.ca/~nwormald/papers/randgen.pdf

WiH03 W. Wiegerinck and T. Heskes (2003): "Fractional Belief Propagation", Advances in Neural Information Processing Systems (NIPS) 15, pp. 438-445, http://books.nips.cc/papers/files/nips15/LT16.pdf

WJW03 M. J. Wainwright, T. S. Jaakkola and A. S. Willsky (2003): "Tree-reweighted belief propagation algorithms and approximate ML estimation by pseudo-moment matching", 9th Workshop on Artificial Intelligence and Statistics, http://www.eecs.berkeley.edu/~wainwrig/Papers/WJW_AIStat03.pdf

YFW05 J. S. Yedidia and W. T. Freeman and Y. Weiss (2005): "Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms", IEEE Transactions on Information Theory 51(7):2282-2312, http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1459044