当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Improved algorithm for the locating-chromatic number of trees
Theoretical Computer Science ( IF 0.9 ) Pub Date : 2020-12-28 , DOI: 10.1016/j.tcs.2020.12.037
Edy Tri Baskoro , Devi Imulia Dian Primaskun

The concept of the locating-chromatic number for graphs was introduced by Chartrand et al. (2002). In this paper, we propose an algorithm to determine the upper bound of the locating-chromatic number of any tree. This algorithm works much better than the one given by Furuya and Matsumoto (2019).



中文翻译:

树色色数的改进算法

Chartrand等人介绍了图的定位色数的概念。(2002)。在本文中,我们提出了一种确定任何树的定位色数上限的算法。该算法比Furuya和Matsumoto(2019)给出的算法要好得多。

更新日期:2021-01-16
down
wechat
bug