Complexity analysis of a decentralised graph colouring algorithm

Information Processing Letters

Volumn 107, Issue 2, 2008, Pages 60-63

  Duffy, K R ^a   O'Connell, N ^b   Sapozhnikov, A ^c  

^a NATIONAL UNIVERSITY OF IRELAND   (Ireland)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c CWI   (Netherlands)

Author keywords

Computational complexity; Graph algorithms; Randomised algorithms

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; GRAPH THEORY;

GRAPH ALGORITHMS; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 44149106164     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.01.002     Document Type: Article

References (10)

1. Alon N., and Kahale N. A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput. 26 6 (1997) 1733-1748
2. Dyer M.E., and Frieze A.M. The solution of some random NP-hard problems in polynomial expected time. J. Algorithms 10 4 (1989) 451-489
3. Feder T., and Motwani R. Worst-case time bounds for coloring and satisfiability problems. J. Algorithms 45 2 (2002) 192-201
4. Garey M.R., and Johnson D.S. Computers and Intractability (1979), W.H. Freeman and Co., San Francisco, CA
5. Kučera L. Expected behavior of graph coloring algorithms. Fundamentals of Computation Theory, Proc. Internat. Conf. Poznań-Kórnik, 1977. Lecture Notes in Comput. Sci. vol. 56 (1977), Springer, Berlin 447-451
6. F. Kuhn, R. Wattenhofer, On the complexity of distributed graph coloring, in: Proc. of the 25th ACM PODC, 2006
7. D.J. Leith, P. Clifford, Convergence of distributed learning algorithms for optimal wireless channel allocation, in: IEEE CDC, 2006, pp. 2980-2985
8. Linial N. Locality in distributed graph algorithms. SIAM J. Comput. 21 1 (1992) 193-201
9. D. Malone, P. Clifford, D. Reid, D. Leith, Experimental implementation of optimal WLAN channel selection without communication, in: IEEE DySPAN, 2007, pp. 316-319
10. Turner J.S. Almost all k-colorable graphs are easy to color. J. Algorithms 9 1 (1988) 63-82