Unique-Minimum Conflict-Free Coloring for a Chain of rings

Abstract

An optimal algorithm is presented about Conflict-Free Coloring for connected subgraphs of chain of rings. Suppose the length of the chain is {pipe}C{pipe} and the maximum length of rings is {pipe}R{pipe}. A presented algorithm in [1] for a Chain of rings used O(log{pipe}C{pipe}.log{pipe}R{pipe}) colors but this algorithm uses O(log{pipe}C{pipe}+log{pipe}R{pipe}) colors. The coloring earned by this algorithm has the unique-min property, that is, the unique color is also minimum. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2012.