Greedy algorithms for generalized k-rankings of paths
A k-ranking of a graph is a labeling of the vertices with positive integers 1,2, ..., k so that every path connecting two vertices with the same label contains a vertex of larger label. An optimal ranking is one in which k is minimized. Let P(n), be a path with n vertices. A greedy algorithm can be used to successively label each vertex with the smallest possible label that preserves the ranking property. We seek to show that when a greedy algorithm is used to label the vertices successively from left to right, we obtain an optimal ranking. A greedy algorithm of this type was given by Bodlaender et al. in 1998 [1] which generates an optimal k-ranking of P(n). In this paper we investigate two generalizations of rankings. We first consider bounded (k, s)-rankings in which the number of times a label can be used is bounded by a predetermined integer s. We then consider k(t)-rankings where any path connecting two vertices with the same label contains t vertices with larger labels. We show for both generalizations that when G is a path, the analogous greedy algorithms generate optimal k-rankings. We then proceed to quantify the minimum number of labels that can be used in these rankings. We define the bounded rank number (r,s)(G) to be the smallest number of labels that can be used in a (k, s)-ranking and show for n 2, (r,s)(P(n)) = [ ((n (2 1))/s)] + i where i = [log(2)(s)] + 1. We define the k(t)-rank number, (t)(r)(G) to be the smallest number of labels that can be used in a k(t)-ranking. We present a recursive formula that gives the k(t)-rank numbers for paths, showing 1;.(P(j)) n for all a(n-1) < j <= a(n) where {a(n)) is defined as follows: a(l) = 1 and a(n) = a(n) = [((t + 1)/t)a(n-1)] + 1. (C) 2010 Elsevier B.V. All rights reserved.
greedy algorithm rank number ordered coloring minimal ranking vertex coloring graph algorithm