Complexity analysis of a decentralised graph colouring algorithm

Authors:
K. R. Duffy;N. O'Connell;A. Sapozhnikov
Affiliations:
Hamilton Institute, National University of Ireland, Maynooth, Ireland;Mathematics Institute, University of Warwick, Coventry, CV4 7AL, UK;Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098SJ Amsterdam, The Netherlands
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 2

Almost all k-colorable graphs are easy to color

Journal of Algorithms
The solution of some random NP-hard problems in polynomial expected time

Journal of Algorithms
Locality in distributed graph algorithms

SIAM Journal on Computing
A Spectral Technique for Coloring Random 3-Colorable Graphs

SIAM Journal on Computing
Worst-case time bounds for coloring and satisfiability problems

Journal of Algorithms
On the complexity of distributed graph coloring

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

WLAN channel selection without communication

Computer Networks: The International Journal of Computer and Telecommunications Networking
Decentralized constraint satisfaction

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.