On the complexity of distributed graph coloring with local minimality constraints

Networks

Volumn 54, Issue 1, 2009, Pages 12-19

  Gavoille, Cyril ^a   Klasing, Ralf ^a   Kosowski, Adrian ^a,b   Kuszner, Łukasz ^b   Navarra, Alfredo ^c  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

^c UNIVERSITY OF PERUGIA   (Italy)

Author keywords

Distributed computing; Graph coloring; Greedy algorithm; Randomization

Indexed keywords

COLORING PROBLEMS; DISTRIBUTED COMPUTATIONS; DISTRIBUTED COMPUTING; FIXED-ORDER; GRAPH COLORING; GRAPH COLORINGS; GREEDY ALGORITHM; LOWER AND UPPER BOUNDS; MAXIMAL INDEPENDENT SET; MINIMALITY; RANDOMIZATION; VERTEX DEGREE;

COLOR; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY;

COLORING;

EID: 68349113756     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20293     Document Type: Article

References (30)

1. B. Awerbuch, A.V. Goldberg, M. Luby, and S.A. Plotkin, Network decomposition and locality in distributed computation, 30th IEEE Symp Foundations Comput Sci (FOCS), IEEE, 1989, pp. 364-369. (Pubitemid 20725973)
2. L. Barenboim and M. Elkin, Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition, 27th Ann ACMSymp Princ Distrib Comput (PODC), ACM Press, 2008, pp. 25-34.
3. R. Battiti, A.A. Bertossi, and M.A. Bonuccelli, Assigning codes in wireless networks: bounds and scaling properties, Wireless Networks 5 (1999), 195-209.
4. P. Chaudhuri, Algorithms for some graph problems on a distributed computational model, Informat Sci 43 (1987), 205-228. (Pubitemid 18546587)
5. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra, Robust algorithms and price of robustness in shunting problems, 7thWorkshop Algorithmic Approaches Transport Modeling Optim Syst (ATMOS), 2007, pp. 175-190.
6. S. Cornelsen and G. Di Stefano, Track assignment, J Discrete Algorithms 5 (2007), 250-261.
7. E. Dahlhaus, P. Horak, M. Miller, and J.F. Ryan, The train marshalling problem, Discrete Appl Math 103 (2000), 41-54.
8. P. Erdo″s, Graph theory and probability, Can J Math 11 (1959), 34-38.
9. I. Finocchi, A. Panconesi, and R. Silvestri, An experimental analysis of simple, distributed vertex coloring algorithms, Algorithmica 41 (2004), 1-23. (Pubitemid 40003136)
10. M. Garey and D. Johnson, Computers and intractability,W.H. Freeman and Company, New York, 1979.
11. C. Gavoille, R. Klasing, A.Kosowski, and A. Navarra, On the complexity of distributed greedy coloring, 21st Int Symp Distrib Comput (DISC),Vol. 4731 of Lecture Notes in Computer Science, 2007, pp. 482-484
12. D.A. Grable and A. Panconesi, Fast distributed algorithms for Brooks-Vizing colorings, J Algorithms 37 (2000), 85-120.
13. P.M. Grundy, Mathematics and games, Eureka 2 (1939), 6-8.
14. J.C. Hansen, M. Kubale, L. Kuszner, and A. Nadolski, Distributed Largest-First algorithm for graph coloring, 10th Eur Conf Parallel Comput (Euro-Par), Vol. 3149 of Lecture Notes in Computer Science, 2004, pp. 804-811. (Pubitemid 39217354)
15. Ö. Johansson, Simple distributed (δ+1)-coloring of graphs, Informat Process Lett 70 (1999), 229-232.
16. A. Kosowski and L. Kuszner, On greedy graph coloring in the distributed model, 12th Eur Conference Parallel Comput (Euro-Par), Vol.4128 of Lecture Notes in Computer Science, 2006, pp. 592-601. (Pubitemid 44568429)
17. A. Kosowski and K. Manuszewski, "Classical graph coloring." Graph colorings, Vol.352: Contemporary mathematics, AMS, 2004, pp. 1-20.
18. M. Kubale, Introduction to computational complexity and algorithmic graph coloring, GTN, Gdánsk, 1998.
19. F. Kuhn, T. Moscibroda, and R.Wattenhofer, What cannot be computed locally!, 23rd ACM Sympo Prin Distrib Comput (PODC), ACM Press, 2004, pp. 300-309.
20. F.Kuhn and R.Wattenhofer, On the complexity of distributed graph coloring, 25th Ann ACM Symp Princ Distrib Comput (PODC), ACM Press, 2006, pp. 7-15.
21. N. Linial, Legal coloring of graphs, Combinatorica 6 (1986), 49-54.
22. N. Linial, Locality in distributed graph algorithms, SIAM J Comput 21 (1992), 193-201.
23. Z. Lotker and A. Navarra, Managing random sensor networks by means of grid emulation, 5th Int IFIP-TC6 Networking Conf,Vol. 3976 of Lecture Notes in Computer Science, 2006, pp. 856-867.
24. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J Comput 15 (1986), 1036-1053. (Pubitemid 17465853)
25. S. Olariu and J. Randall, Welsh-Powell opposition graphs, Informat Process Lett 31 (1989), 43-46.
26. A. Panconesi and R. Rizzi, Some simple distributed algorithms for sparse networks, Distrib Comput 14 (2001), 97-100.
27. A. Panconesi and A. Srinivasan, On the complexity of distributed network decomposition, J Algorithms 20 (1996), 356-374. (Pubitemid 126412189)
28. J. Schneider and R.Wattenhofer, A log-star distributed maximal independent set algorithm for growth-bounded graphs, 27th Ann ACM Symp Princ Distrib Comput (PODC), ACM Press, 2008, pp. 35-44.
29. J.S. Turner, Almost all k-colorable graphs are easy to color, J Algorithms 9 (1988), 63-82.
30. D. Zuckerman, Linear degree extractors and the inapproximability of max clique and chromatic number, 38th ACM Symp Theory Comput (STOC), ACM Press, 2006, pp. 681- 690. (Pubitemid 44306602)