A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem
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 b...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
European Alliance for Innovation (EAI)
2021-06-01
|
| Series: | EAI Endorsed Transactions on Scalable Information Systems |
| Subjects: | |
| Online Access: | https://eudl.eu/pdf/10.4108/eai.16-2-2021.168716 |