Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

69

IPL
2008

favoriteEmaildiscussreport

145views more IPL 2008»

Complexity analysis of a decentralised graph colouring algorithm

14 years 11 months ago

Complexity analysis of a decentralised graph colouring algorithm

Download www.math.ethz.ch

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.

Ken R. Duffy, N. O'Connell, Artëm Sapozhnikov

Real-time Traffic

Algorithm | Chromatic Number | Global Structure | IPL 2008 |

claim paper

Related Content

» A decentralised coordination algorithm for minimising conflict and maximising coverage in ...

» Decentralised coordination of lowpower embedded devices using the maxsum algorithm

» Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation

» The complexity of choosing an Hcolouring nearly uniformly at random

» Colouring constraint satisfaction and complexity

» Colouring Random 4Regular Graphs

» Separating a Colour Texture from an Arbitrary Background

» Decentralised Autonomic Computing Analysing SelfOrganising Emergent Behaviour using Advanc...

» Colouring Random Regular Graphs

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Ken R. Duffy, N. O'Connell, Artëm Sapozhnikov

Comments (0)