Complexity analysis of a decentralised graph colouring algorithm
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which decisions are made locally with no information about the graph's global structure is particularly 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. (C) 2008 Elsevier B.V. All rights reserved.
computational complexity graph algorithms randomised algorithms