David Maxwell Checkering, David Heckerman, and Christopher Meek (1997), “A Bayesian approach to learning Bayesian networks with local structure”, in Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI-97), pp. 80-89 pdf

C. Chow and C. Liu (1968), “Approximating discrete probability distributions with dependence trees”, IEEE Transactions on Information Theory, 14(3): 462-467 link

Ross D. Schachter (1998), “Bayes-Ball: The rational pastime (for determining irrelevance and requisite information in belief networks and influence diagrams”, in Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98), pp. 480-487, pdf

Robert E. Tarjan and Mihalis Yannakakis (1984), “Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs”, SIAM Journal on Computing, 13(3): 566-579 link

Martin J. Wainwright and Michael Jordan, “Graphical models, exponential families, and variational inference”, short (Allerton, 2003) medium (Berkeley Statistics TR-649, 2003) long (Foundations and Trends in Machine Learning, 1 (1-2), 1-305)

Fahiem Bacchus and Adam Grove (1995), “Graphical models for preference and utility”, in Proceedings of the Eleventh Annucal Conference on Uncertainty in Artificial Intelligence (UAI-95), pp. 3-10 pdf

Craig Boutilier, Fahiem Bacchus, and Ronen I. Brafman (2001), “UCP-Networks: a directed graphical representation of conditional utilities”, in Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI-01), pp. 56-64 pdf

Michael H. Birnbaum and Laura A. Thompson (1996), “Violations of monotonicity in choices between gambles and certain cash”, The American Journal of Psychology, 109(4), pp. 501-523 link