• The KIPS Transactions:PartB
• /
• v.15B no.4
• /
• pp.341-346
• /
• 2008

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.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2124-2132
• /
• 1999

Given a graph G=(V,E), Ld(2,1)-labeling of G is a function f : V(G)$\longrightarrow$[0,$\infty$) such that, if v1,v2$\in$V are adjacent, $\mid$ f(x)-f(y) $\mid$$\geq$2d, and, if the distance between and is two, $\mid$ f(x)-f(y) $\mid$$\geq$d, where dG(,v2) is shortest distance between v1 and in G. The L(2,1)-labeling number (G) is the smallest number m such that G has an L(2,1)-labeling f with maximum m of f(v) for v$\in$V. This problem has been studied by Griggs, Yeh and Sakai for the various classes of graphs. In this paper, we discuss the upper-bound of ${\lambda}$ (G) for a chordal graph G and that of ${\lambda}$(G') for a permutation graph G'.