1. Abbeel P, Koller D, Ng AY (2006) Learning factor graphs in polynomial time and sample complexity. J Mach Learn Res 7:1743–1788
2. Baluja S, Davies S (1997) Using optimal dependency-trees for combinatorial optimization: learning the structure of the search space. In: Fisher DH (ed) Proceedings of the 14th international conference on machine learning. Morgan Kaufmann, San Francisco, pp 30–38
3. Batra D, Gallagher A, Parikh D, Chen T (2010) Beyond trees: MRF inference via outer-planar decomposition. In: 2010 IEEE conference on computer vision and pattern recognition (CVPR). IEEE, San Francisco, pp 2496–2503
4. Bickson D (2008) Gaussian belief propagation: theory and application. arXiv preprint arXiv:0811.2518 . Accessed 18 Dec 2014
5. Braunstein A, Mézard M, Zecchina R (2005) Survey propagation: an algorithm for satisfiability. Random Struct Algorithms 27(2):201–226