Complexity analysis of a decentralised graph colouring algorithm
Duffy, K.R. and O’Connell, N. and Sapozhnikov, A. (2008) Complexity analysis of a decentralised graph colouring algorithm. Information Processing Letters . ISSN 0020-0190 AbstractColouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph’s global structure is particuarly challenging. In this article we analyse the complexity of a decentralised
colouring algorithm that has recently been proposed for channel selection in wireless computer networks. | Keywords: | Decentralised graph colouring algorithm; NP-hard; wireless computer networks; Computational complexity; Graph algorithms; Randomized algorithms; Hamilton Institute. |
|---|
| Subjects: | Science & Engineering > Hamilton Institute
Science & Engineering > Mathematics |
|---|
| ID Code: | 1677 |
|---|
| Deposited By: | Hamilton Editor |
|---|
| Deposited On: | 18 Nov 2009 10:02 |
|---|
| Journal or Publication Title: | Information Processing Letters |
|---|
| Publisher: | Elsevier |
|---|
| Refereed: | Yes |
|---|
Repository Staff Only: item control page
|
![[img]](http://eprints.nuim.ie/style/images/fileicons/application_pdf.png)