Complexity analysis of a decentralised graph colouring
algorithm

Abstract

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.