Back to Search
Start Over
Improved algorithm for the locating-chromatic number of trees.
- Source :
-
Theoretical Computer Science . Feb2021, Vol. 856, p165-168. 4p. - Publication Year :
- 2021
-
Abstract
- 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). [ABSTRACT FROM AUTHOR]
- Subjects :
- *ALGORITHMS
*TREES
*NUMBER concept
*TREE graphs
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 856
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 148122242
- Full Text :
- https://doi.org/10.1016/j.tcs.2020.12.037