1. S. Yang, J. Baras, Factor join trees for systems exploration, in: Proceedings 23rd International Conference on Software & Systems Engineering and their Applications, Paris, France, 2011.
2. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Applied Mathematics,1989
3. K. Murphy, Y. Weiss, The factored frontier algorithm for approximate inference in dbns, in: Proceedings of the Seventeenth Annual Confer- ence on Uncertainty in Artificial Intelligence (UAI-01), Morgan Kaufmann, San Francisco, CA, 2001, pp. 378-385.
4. A. Ferrara, G. Pan, M. Vardi, Treewidth in verification: Local vs. global, in: Logic for Programming, Artificial Intelligence, and Reasoning, Springer, 2005, pp. 489-503.
5. K. Murphy, Dynamic bayesian networks: Representation, inference and learning, Ph.D. thesis, University of California, Berkeley (2002).