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 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.

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Ken R. Duffy, N. O'Connell, Artëm Sapozhnikov
• Keywords: Algorithm, Chromatic Number, Global Structure, IPL 2008