Browse > Article
http://dx.doi.org/10.3745/KIPSTB.2008.15-B.4.341

Solving Minimum Weight Triangulation Problem with Genetic Algorithm  

Han, Keun-Hee (공주대학교 응용수학과)
Kim, Chan-Soo (공주대학교 응용수학과)
Publication Information
The KIPS Transactions:PartB / v.15B, no.4, 2008 , pp. 341-346 More about this Journal
Abstract
Minimum Weight Triangulation (MWT) problem is an optimization problem searching for the triangulation of a given graph with minimum weight. Like many other graph problems this problem is also known to be NP-hard for general graphs. Several heuristic algorithms have been proposed for this problem including simulated annealing and genetic algorithm. In this paper, we propose a new genetic algorithm called GA-FF and show that the performance of the proposed genetic algorithm outperforms the previous one.
Keywords
Minimum Weight Triangulation; Genetic Algorithms; Chordal Graphs;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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   DOI
2 De Jong, K. A., An analysis of the behavior of a class of genetic adaptive systems, Ph.D. Dissertation, University of Michigan, 1975
3 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   DOI
4 M. Yannakakis, “Computing the minimum fill-in is NPcomplete,” SIAM J. Algebraic Discrete Methods 2, pp.77-79, 1981   DOI
5 Finn V. Jensen, “An introduction to Bayesian networks,” UCL Press, 1996
6 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
7 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   DOI
8 Norsys Software Corp., http://www.norsys.com, 2006
9 Tarjan, Robert Endre, “Maximum Cardinality Search and chordal graphs,” Stanford Univ. Unpublished Lecture Notes CS 259
10 Uffe Kjaerulff, “Triangulation of graphs – Algorithms giving small total state space,” Research Report R-90-09, Department of Computer Science, Aalborg University, 1990
11 Zbigniew Michalewicz, "Genetic Algorithms + Data Structures = Evolution Programs," Springer-Velag, Berlin, 1992
12 Pinar Heggernes, “Minimal triangulations of graphs: A survey,” Discrete Mathematics 306, pp.297-317, 2006   DOI   ScienceOn