Journal of the Korean Institute of Intelligent Systems (한국지능시스템학회논문지)

Korean Institute of Intelligent Systems (한국지능시스템학회)
권호 표지
DOI QR코드

DOI QR Code

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

Simulated Annealing 알고리즘에 기반한 L(2,1)-labeling 문제 연구

  • 한근희 (공주대학교 응용수학과) ;
  • 이용진 (공주대학교 응용수학과)
  • Received : 2010.10.29
  • Accepted : 2011.01.30
  • Published : 2011.02.25
Download PDF
⟨ Previous Next ⟩

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.

그래프 G = (V, E )의 L(2, 1)-labeling 은 무선통신에서 무선 기기에 할당되는 주파수를 효율적으로 사용하기 위한 최적화 문제로서 NP-complete 계열에 포함되는 문제이다. 본 연구에서는 L(2, 1)-labeling 문제에 적용 가능한 Simulated Annealing 알고리즘을 제시한 후 다양한 그래프에 제시된 알고리즘을 적용하여 그 효용성을 보이고자 한다.

Keywords

References

  1. W. K. Hale, “Frequency assignment,” Theory and application, Proc. IEEE, vol. 68, pp. 1497–1514, 1980. https://doi.org/10.1109/PROC.1980.11899
  2. F. S. Roberts, “T-colorings of graphs : Recent results and open problems,” Discr. Math. vol. 93, pp. 229–245, 1991.
  3. 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. https://doi.org/10.1137/0405048
  4. G. J. Chang and D. Kuo, “The L(2,1)-labeling on graphs,” SIAM J. Discr. Math., vol. 9, pp. 309–316, 1996.
  5. D. Kral and R. Skrekovski, “A theorem about channel assignment problem,” SIAM J. Discr. Math., vol. 16, pp. 426–437, 2003.
  6. D. Goncalves, “On the L(p,1)-labeling of graphs,” Discr. Math. and Theor. Comp. Science AE, pp. 81-86, 2005.
  7. 한근희, 김찬수, “유전자 알고리즘 이용한 그래프에서 L(2,1)-labeling 문제 연구,” 정보처리학회논문지 B, 제 15-B 권, 제 2 호, pp. 131-136, 2008 https://doi.org/10.3745/KIPSTB.2008.15-B.2.131
  8. Zbigniew Michalewicz, “Genetic Algorithms + Data Structures = Evolution Programs,” Springer-Verlag, Berlin, 1992.
  9. West. B, “Introduction to Graph Theory,” Hall & Co., 2000.
  10. S. Kirkpatrick, C.D. Gelatt, M.P., Vecchi, Optimization by simulated annealing, Science 220, pp. 671-680, 1983. https://doi.org/10.1126/science.220.4598.671
  11. 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. https://doi.org/10.1093/comjnl/47.2.193
  12. D. Coppersmith and S. Winograd, “Matirx multiplication via arithmetic progression”, Proceedings of the 19th ACM Symposium on Theory of Computing, pp. 1-6, 1987.