论文信息 - Complexity analysis of a decentralised graph colouring algorithm

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.

[1] Nathan Linial,et al. Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[2] Martin E. Dyer,et al. The Solution of Some Random NP-Hard Problems in Polynomial Expected Time , 1989, J. Algorithms.

[3] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[4] Ludek Kucera,et al. Expected Behavior of Graph Coloring Algorithms , 1977, FCT.

[5] D.J. Leith,et al. Convergence of Distributed Learning Algorithms for Optimal Wireless Channel Allocation , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[6] Roger Wattenhofer,et al. On the complexity of distributed graph coloring , 2006, PODC '06.

[7] Jonathan S. Turner,et al. Almost All k-Colorable Graphs are Easy to Color , 1988, J. Algorithms.

[8] D.J. Leith,et al. Experimental Implementation of Optimal WLAN Channel Selection without Communication , 2007, 2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks.

[9] Rajeev Motwani,et al. Worst-case time bounds for coloring and satisfiability problems , 2002, J. Algorithms.

[10] D. Welsh,et al. A Spectral Technique for Coloring Random 3-Colorable Graphs , 1994 .