Indian Journal of Science and Technology
Year: 2016, Volume: 9, Issue: 45, Pages: 1-4
Sudhanshuprakashtiwari*, M. VijayaRaju, Gurbakashphonsa and Deepak kumar Deepu
*Author for correspondence
Sudhanshuprakashtiwari Department of Computer Science and Engineering, LPU, Phagwara - 144411, Punjab, India; [email protected]
Objectives: This paper aims towards giving colors optimally to the vertices of the graph so that graph coloring constraints can be satisfied. Methods: A hybridized algorithm that consists of Cuckoo Search along with LDO algorithm is proposed to show a comparative and more optimal algorithm for graph coloring problem. Findings: Graph coloring relates graph regions coloring in a way so that sequence of coloring will meet with all the constraints of coloring. Novelty: Hybridization of nature-inspired algorithm with Mantegna algorithm finds out the new nest positions when the nest having worst survival rate are destroyed. The Largest degree Ordering is utilized in assigning the color coding to the nodes with the nodes having the largest degree first. The experimental results prove that hybridized solution works well using moderate size and provides another approach for the same.
Keywords: Degree based Ordering, Graph Coloring
Subscribe now for latest articles and news.