Shukla, Ajay and Bharti, Vishal and Garg, M. (2021) A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem. EAI Endorsed Transactions on Scalable Information Systems.
![[thumbnail of 44981.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "44981.pdf")
PDF
44981.pdf
Download (2MB)
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 b
| Item Type: | Article |
|---|---|
| Date Deposited: | 04 Mar 2026 14:26 |
| Last Modified: | 11 Apr 2026 18:38 |
| URI: | http://eprints.eai.eu/id/eprint/34795 |
Actions (login required)
- View Item