1. Besag, J.: On the statistical analysis of dirty pictures. J. R. Stat. Soc. B 48(3), 259–302 (1986)
2. Billionet, A., Minoux, M.: Maximizing a supermodular pseudo-Boolean function: a polynomial algorithm for cubic functions. Discrete Appl. Math. 12(1), 1–11 (1985)
3. Boros, E., Gruber, A.: On quadratization of pseudo-Boolean functions. In: Proceedings of the International Symposium on Artificial Intelligence and Mathematics (ISAIM’12) (2012)
4. Charpiat, G.: Exhaustive family of energies minimizable exactly by a graph cut. In: Proceedings of the 24th IEEE Conference on Computer Vision and Pattern Recognition (CVPR’11), pp. 1849–1856. IEEE, New York (2011)
5. Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: A maximal tractable class of soft constraints. J. Artif. Intell. Res. 22, 1–22 (2004)