An Optimal Algorithm for Conflict-Free Coloring for Tree of Rings

Details An Optimal Algorithm for Conflict-Free Coloring for Tree of Rings An Optimal Algorithm for Conflict-Free Coloring for Tree of Rings

2012-03-12

arxiv.org/abs/1203.2414v1

Computer Science

Data Structures and Algorithms

Scientific paper

An optimal algorithm is presented about Conflict-Free Coloring for connected subgraphs of tree of rings. Suppose the number of the rings in the tree is |T| and the maximum length of rings is |R|. A presented algorithm in [1] for a Tree of rings used O(log|T|.log|R|) colors but this algorithm uses O(log|T|+log|R|) colors. The coloring earned by this algorithm has the unique-min property, that is, the unique color is also minimum.

Affiliated with

Also associated with

No associations

Rating

An Optimal Algorithm for Conflict-Free Coloring for Tree of Rings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Optimal Algorithm for Conflict-Free Coloring for Tree of Rings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Optimal Algorithm for Conflict-Free Coloring for Tree of Rings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-487980