1. Chickering, D. M. (1995). A Transformational characterization of Bayesian network structures. In Proceedings of Eleventh Conference on Uncertainty in Artificial Intelligence,Montreal, QU. Morgan Kaufman.
2. Cooper, G. and Herskovits, E. (1992). A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9: 309–347.
3. Garey, M. and Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman.
4. Garvil, F. (1977). Some NP-complete problems on graphs. In Proc. 11th Conf. on Information Sciences and Systems, Johns Hopkins University, pages 91–95. Baltimore, MD.
5. Heckerman, D., Geiger, D., and Chickering, D. (1995). Learning discrete Bayesian networks. Machine Learning, 20: 197–243.