Abstract
This paper describes an efficient algorithm for graph colouring problem using less number of colours. The proposed scheme is applicable for all types of graphs. The algorithm divides the neighbours of a vertex into two categories N-type and F-type, and checks the colour filled in V-type neighbour before filling in the current vertex. Algorithm selects a colour from the list of colours, K every time from the beginning of the list colour so that it can make use less number of colours. We compare our results with those obtained using genetic algorithms, Brown's algorithm and other heuristics algorithms. Experiments have been conducted on previously used standard graphs and configuration of graphs to demonstrate the effectiveness of our approach.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.