References
Aho, A., Hopcroft, J.E., & Ullman, J. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company.
Aji, S.M. 1999. Graphical Models and Iterative Decoding. Ph.D. thesis, California Institute of Technology.
Aji, S.M., & McEliece, R.J. 2000. The Generalized Distributive Law. IEEE Trans. On Information Theory, 46(2), 325–343.
Allen, D., & Darwiche, A. 2002. On the Optimality of the min-fill Heuristic. Tech. rept. University of California, Los Angeles.
Allen, D., & Darwiche, A. 2003. Optimal Time-Space Tradeoff in Probabilistic Inference. Pages 969–975 of: IJCAI’03: Proc. of the 18th Int. Joint Conference on Artif. Intell. Morgan Kaufmann Publishers, Inc.
Almond, R., & Kong, A. 1991. Optimality Issues in Constructing a Markov Tree from Graphical Models. Research Report A-3. Department of Statistics, Harvard University.
Apt, K.R. 2003. Principles of Constraint Programming. Cambridge University Press.
Arnborg, S. 1985. Efficient Algorithms for Combinatorial Problems with Bounded Decomposability – A Survey. BIT, 25(1), 2–23.
Arnborg, S., Corneil, D., & Proskurowski, A. 1987. Complexity of Finding Embeddings in a k-Tree. SIAM J. of Algebraic and Discrete Methods, 8, 277–284.
Bacchus, F., & Adam, G. 1995. Graphical Models for Preference and Utility. Pages 3–10 of: UAI’95: Proc. of the 11th Conference on Uncertainty in Artif. Intell. Morgan Kaufmann Publishers, Inc.
Bacchus, F., Dalmao, S., & Pitassi, T. 2003. Value Elimination: Bayesian Interence ...
