Cooper, G., & Herskovits, E. (1992). A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9, 309-347.

Dasgupta, S. (1999). Learning polytrees. In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, Stockholm, Sweden, pp. 134–141. Morgan Kaufmann.

Edmonds, J. (1967). Optimum braning. J. Res. NBS, 71B, 233–240.

Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman, New York.

Heckerman, D. (1998). A tutorial on learning with Bayesian networks. In Jordan, M. (Ed.),
Learning in Graphical Models, pp. 301–354. Kluwer Academic Publishers.

Heckerman, D., Geiger, D., & Chickering, D. (1995). Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20, 197-243.

Karp, R., & Held, M. (1971). The traveling-salesman problem and minimum spanning trees:
Part ii. Mathematical Programming, 1, 6-25.

Lauritzen, S. (1996). Graphical Models. Oxford University Press.

Ma, S., & Hellerstein, J. (1999). Ordering categorical data to improve visualization. In Proceedings of the IEEE Symposium on Information Visualization, pp. 15–17.