A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem

Shukla, Ajay Narayan and Bharti, Vishal and Garg, M. L. (2021) A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem. EAI Endorsed Transactions on Scalable Information Systems, 8 (31). e4. ISSN 2032-9407

[img]
Preview
Text
eai.16-2-2021.168716.pdf
Available under License Creative Commons Attribution No Derivatives.

Download (2MB) | Preview

Abstract

Graph colouring problem is a well-known NP-class optimization problem, studied due to a lot of applications in various real-world problems. Some of these applications are: register allocation, image processing and communication networks. There are various techniques suggested by the researchers to solve the problem which is either exact or approximate in nature. In this paper, a new greedy technique, based on degrees of vertices in the graph is presented to solve the graph colouring problem in an improved manner. The technique involves the use of adjacency matrix along with another matrix generated for the set of possible colours for each vertex in the graph. The generated colour matrix is used to assign the colours among the vertices in the graph based on decreasing degrees of the vertices. Several DIMACS colouring instances solved using the suggested approach in the article and compared with some contemporary techniques for the performance and proves compatible and having better execution time with compared technique. The obtained colouing results are mostly optimal colour values corresponding to the examined colouring instances of the graph.

Item Type: Article
Uncontrolled Keywords: Graph Colouring, Adjacency Matrix, Greedy Technique, Colour Matrix
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
QA75 Electronic computers. Computer science
T Technology > T Technology (General)
Depositing User: EAI Editor IV
Date Deposited: 09 Jul 2021 08:31
Last Modified: 09 Jul 2021 08:31
URI: https://eprints.eudl.eu/id/eprint/4392

Actions (login required)

View Item View Item