Browse > Article
http://dx.doi.org/10.5391/JKIIS.2011.21.1.138

Study on the L(2,1)-labeling problem based on simulated annealing algorithm  

Han, Keun-Hee (공주대학교 응용수학과)
Lee, Yong-Jin (공주대학교 응용수학과)
Publication Information
Journal of the Korean Institute of Intelligent Systems / v.21, no.1, 2011 , pp. 138-144 More about this Journal
Abstract
L(2, 1)-labeling problem of a graph G = (V, E) is a problem to find an efficient way to distribute radio frequencies to various wireless equipments in wireless networks. In this work, we suggest a Simulated Annealing algorithm that can be applied to the L(2, 1)-labeling problem. By applying the suggested algorithm to various graphs we will try to show the efficiency of our algorithm.
Keywords
Graph; L(2, 1)-labeling; Simulated Annealing algorithm;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Hans L. Bodlaender, Ton Kloks, Richard B. Tan and Jan van Leeuwen, Approximations for $\lambda$-coloring of graphs, The Computer Journal 47, pp. 193-204, 2004.   DOI
2 D. Coppersmith and S. Winograd, “Matirx multiplication via arithmetic progression”, Proceedings of the 19th ACM Symposium on Theory of Computing, pp. 1-6, 1987.
3 W. K. Hale, “Frequency assignment,” Theory and application, Proc. IEEE, vol. 68, pp. 1497–1514, 1980.   DOI
4 F. S. Roberts, “T-colorings of graphs : Recent results and open problems,” Discr. Math. vol. 93, pp. 229–245, 1991.
5 J. R. Griggs and R. K. Yeh, “Labeling graphs with a condition at distance two,” SIAM J. Discr. Math., vol. 5, pp. 586-595, 1992.   DOI
6 G. J. Chang and D. Kuo, “The L(2,1)-labeling on graphs,” SIAM J. Discr. Math., vol. 9, pp. 309–316, 1996.
7 한근희, 김찬수, “유전자 알고리즘 이용한 그래프에서 L(2,1)-labeling 문제 연구,” 정보처리학회논문지 B, 제 15-B 권, 제 2 호, pp. 131-136, 2008   과학기술학회마을   DOI
8 D. Kral and R. Skrekovski, “A theorem about channel assignment problem,” SIAM J. Discr. Math., vol. 16, pp. 426–437, 2003.
9 D. Goncalves, “On the L(p,1)-labeling of graphs,” Discr. Math. and Theor. Comp. Science AE, pp. 81-86, 2005.
10 Zbigniew Michalewicz, “Genetic Algorithms + Data Structures = Evolution Programs,” Springer-Verlag, Berlin, 1992.
11 West. B, “Introduction to Graph Theory,” Hall & Co., 2000.
12 S. Kirkpatrick, C.D. Gelatt, M.P., Vecchi, Optimization by simulated annealing, Science 220, pp. 671-680, 1983.   DOI