{'fraction_non_alphanumeric': 0.03617571059431524, 'fraction_numerical': 0.003875968992248062, 'mean_word_length': 3.813664596273292, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Algorithm for l-vertex-coloring of trees

Let l be a positive integer, and G be a graph with nonnegative integer weights on edges. Then a generalized vertex-coloring, called an l-vertex-coloring of G, is an assignment of colors to the vertices in such a way that any two vertices u and v get different colors if the distance between u and v in G is at most l. A coloring is optimal if it uses minimum number of distinct colors. The l-vertex-coloring problem is to find an optimal l-vertex-coloring of a graph G. In this paper we present an O(n2 + nΔl+1) time algorithm to find an l-vertex-coloring of a tree T, where Δ is the maximum degree of T. The algorithm takes O(n2) time if both l and Δ are bounded integers. We also compute the upper bound of colors to be equations.