A Clustered Based Novel Approach of Graph Coloring

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 6

Abstract

 Abstract: An efficient graph coloring algorithm is proposed in this research paper that uses less number of colors for a graph coloring problem. The proposed algorithm is applicable for all types of graph. The algorithm works by dividing the vertices into two clusters i.e. non-visited type of clusters including the nodes that are not colored and visited type of clusters including the nodes that are already colored and finds maximum number of color that have been filled into visited nodes. An assumption is taken that k number of colors is already known and the colors are selected from the same k-colors. The proposed algorithm is implemented on random graphs along with well known ECG algorithm. In most of the cases the proposed algorithm provides better result and uses less number of colors as compare to ECG algorithm.

Authors and Affiliations

Sapna Arya , Manish Dixit

Keywords

Related Articles

 Unique Identity / Unique Human Identity / Unique WorldIdentity / Unique Citizen Identity / Human Identity / CitizenIdentity – Number

 Abstract: Unique Identity for every human and non-human entity on the earth is the crucial issue for the timebeing. Unique Identity means assigning numeric identity number to every human aged greater or equal to 0...

Providing High Security and Recovering Good Quality Image using Visual Cryptographic Technique

Abstract: Security is an important factor, since many digital images are transmitted through internet, which contains secret information. Symmetric and Asymmetric methods are two types of cryptographic techniques used to...

 Modern Computer Implementation on Smart Phone withAndroid Platform for Smes (UMKM) in Optimization ServicesDistrict Malang

Abstract: The use of Android in the smartphone operating system currently used by many companies. Because of its superiority as a software that uses computer code base that can be distributed openly (open source) so many...

 Handwritten Bangla Character Recognition Using Normalized Cross Correlation

 Abstract: This paper presents a system for recognizing Bangla handwritten characters using template matching algorithm based on normalized cross-correlation. The Bangla alphabets Sorborno and Banjonborno have been...

 Image Steganography Based On Hill Cipher with Key Hiding  Technique

 In today’s digital world invisible ink and paper have been replaced by much more versatile and practical covers for hiding messages – digital documents, images, video, and audio files. As long as an electronic...

Download PDF file
  • EP ID EP163132
  • DOI -
  • Views 104
  • Downloads 0

How To Cite

Sapna Arya, Manish Dixit (2014).  A Clustered Based Novel Approach of Graph Coloring. IOSR Journals (IOSR Journal of Computer Engineering), 16(6), 14-17. https://europub.co.uk/articles/-A-163132