1. Network Flows.;Ahuja,1993
2. Almond, R., Kong, A., 1993. Optimality issues in constructing a Markov tree from graphical models. Unpublished manuscript.
3. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Math.,1993
4. Badsberg, J.H., 1995. An environment for graphical models. Part I: efficient algorithms for estimation in contingency tables. Ph.D. Thesis, Department of Mathematics and Computer Science, Ålborg University, Denmark.
5. Badsberg, J.H., 1996. Decomposition of graphs and hypergraphs with identification of conformal hypergraphs. Research Report R 96-2032. Department of Mathematics & Computer Science, Ålborg University, Denmark.