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
Colouring 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.
Repository Staff Only: item control page