1. Optimality issues in constructing a Markov tree from graphical models;Almond;Journal of Computational and Graphical Statistics.,1993
2. Complexity of finding embeddings in a k-tree;Arnborg;SIAM Journal on Algebraic and Discrete Methods,1987
3. Becker, A., and Geiger, D. (1994). Greedy-like approximation algorithms for the weighted vertex feedback set problem. In this proceedings.
4. The computational complexity of probabilistic inference using Bayesian belief networks;Cooper;Artificial Intelligence,1990
5. Graphs and Algorithms.;Goudran,1984