Complexity analysis of a decentralised graph colouring algorithm

Duffy, Ken R. and O’Connell, N. and Sapozhnikov, A. (2008) Complexity analysis of a decentralised graph colouring algorithm. Information Processing Letters. ISSN 0020-0190

[img] Download (150kB)

Share your research

Twitter Facebook LinkedIn GooglePlus Email more...

Add this article to your Mendeley library


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.

Item Type: Article
Keywords: Decentralised graph colouring algorithm; NP-hard; wireless computer networks; Computational complexity; Graph algorithms; Randomized algorithms; Hamilton Institute.
Academic Unit: Faculty of Science and Engineering > Research Institutes > Hamilton Institute
Faculty of Science and Engineering > Mathematics and Statistics
Item ID: 1677
Depositing User: Hamilton Editor
Date Deposited: 18 Nov 2009 10:02
Journal or Publication Title: Information Processing Letters
Publisher: Elsevier
Refereed: Yes

    Repository Staff Only(login required)

    View Item Item control page

    Document Downloads

    More statistics for this item...