Advances in Computer Science and Information Technology. Computer Science and Engineering. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part II

Research Article

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

Download
239 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-27308-7_35,
        author={Einollah Pira},
        title={Unique-Minimum Conflict-Free Coloring for a Chain of Rings},
        proceedings={Advances in Computer Science and Information Technology. Computer Science and Engineering. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part II},
        proceedings_a={CCSIT PATR II},
        year={2012},
        month={11},
        keywords={Conflict-Free Coloring Chain Chain of Rings},
        doi={10.1007/978-3-642-27308-7_35}
    }
    
  • Einollah Pira
    Year: 2012
    Unique-Minimum Conflict-Free Coloring for a Chain of Rings
    CCSIT PATR II
    Springer
    DOI: 10.1007/978-3-642-27308-7_35
Einollah Pira1,*
  • 1: The Business Training Center of Tabriz
*Contact email: pira_ep2006@yahoo.com

Abstract

An optimal algorithm is presented about Conflict-Free Coloring for connected subgraphs of chain of rings. Suppose the length of the chain is || and the maximum length of rings is ||. A presented algorithm in [1] for a Chain of rings used ||||colors but this algorithm uses ||||colors. The coloring earned by this algorithm has the unique-min property, that is, the unique color is also minimum.