참고문헌
- Pinar Heggernes, “Minimal triangulations of graphs: A survey,” Discrete Mathematics 306, pp.297-317, 2006 https://doi.org/10.1016/j.disc.2005.12.003
- S. Arnborg, D.G. Corneil, A Proskurowsi, “Complexity of finding embeddings in a k-tree,” SIAM J. Algebraic Discrete Methods 8, pp.277-284, 1987 https://doi.org/10.1137/0608024
- M. Yannakakis, “Computing the minimum fill-in is NPcomplete,” SIAM J. Algebraic Discrete Methods 2, pp.77-79, 1981 https://doi.org/10.1137/0602010
- Finn V. Jensen, “An introduction to Bayesian networks,” UCL Press, 1996
- Wen, W. X., “Optimal decomposition of belief networks,” In Uncertainty in Artificial Intelligence 6 (P. P. Bonissone, M. Henrion, L. N. Kanal, and J. F. Lemmer, eds), North-Holland, Amsterdam, pp.209-224, 1990
- Pedro Larranaga, Cindy M. H. Kuijpers, Milel Poza and Roberto H. Murga, “Decomposing Bayesian networks: triangulation of the moral graphs with genetic algorithm,” Statistics and Computing 7, pp.19-34, 1997 https://doi.org/10.1023/A:1018553211613
- D.J. Rose, R.E. Tarjan and G.S. Lueker, “Algorithmic aspects of vertex elimination on graphs,” SIAM J. Comput. 5, pp.266-283, 1976 https://doi.org/10.1137/0205021
- Norsys Software Corp., http://www.norsys.com, 2006
- Uffe Kjaerulff, “Triangulation of graphs – Algorithms giving small total state space,” Research Report R-90-09, Department of Computer Science, Aalborg University, 1990
- Tarjan, Robert Endre, “Maximum Cardinality Search and chordal graphs,” Stanford Univ. Unpublished Lecture Notes CS 259
- Zbigniew Michalewicz, "Genetic Algorithms + Data Structures = Evolution Programs," Springer-Velag, Berlin, 1992
- De Jong, K. A., An analysis of the behavior of a class of genetic adaptive systems, Ph.D. Dissertation, University of Michigan, 1975