Abstract
In the paper we consider distributed algorithms for greedy graph coloring. For the largest-first (LF) approach, we propose a new distributed algorithm which is shown to color a graph in an expected time of O(ΔlognlogΔ) rounds, and we prove that any distributed LF-coloring algorithm requires at least Ω(Δ) rounds. We discuss the quality of obtained colorings in the general case and for particular graph classes. Finally, we show that other greedy graph coloring approaches, such as smallest-last (SL) or dynamic-saturation (SLF), are not suitable for application in distributed computing, requiring Ω(n) rounds.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Battiti, R., Bertossi, A.A., Bonuccelli, M.A.: Assigning codes in wireless networks. Wireless Networks 5, 195–209 (1999)
Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability — towards tight results. SIAM J. Comp. 27, 804–915 (1998)
Chaudhuri, P.: Algorithms for some graph problems on a distributed computational model. Information Sciences 43, 205–228 (1987)
Grable, D.A., Panconesi, A.: Fast distributed algorithms for Brooks-Vizing colorings. J. Algorithms 37, 85–120 (2000)
Grundy, P.M.: Mathematics and games. Eureka 2, 6–8 (1939)
Hansen, J., Kubale, M., Kuszner, Ł., Nadolski, A.: Distributed largest-first algorithm for graph coloring. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, vol. 3149, pp. 804–811. Springer, Heidelberg (2004)
Johansson, Ö.: Simple distributed (Δ + 1)-coloring of graphs. Inf. Process. Lett. 70, 229–232 (1999)
Kosowski, A., Manuszewski, M.: Classical Coloring of Graphs. In: Graph Colorings. AMS Contemporary Math., vol. 352, pp. 1–20. Providence, USA (2004)
Kubale, M.: Introduction to Computational Complexity and Algorithmic Graph Coloring. GTN, Gdańsk, Poland (1998)
Kubale, M., Kuszner, Ł.: A better practical algorithm for distributed graph coloring. In: Proc. PARELEC, pp. 72–75 (2002)
Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21, 193–201 (1992)
Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15, 1036–1053 (1986)
De Marco, G., Pelc, A.: Fast distributed graph coloring with O(Δ) colors. In: Proc. SODA, pp. 630–635 (2001)
Olariu, S., Randall, J.: Welsh-Powell opposition graphs. Inf. Process. Lett. 31, 43–46 (1989)
Panconesi, A., Rizzi, R.: Some simple distributed algorithms for sparse networks. Distributed Computing 14, 97–100 (2001)
Panconesi, A., Srinivasan, A.: Improved distributed algorithms for coloring and network decomposition problems. In: Proc. STOC, pp. 581–592 (1992)
Turner, J.S.: Almost all k-colorable graphs are easy to color. J. Algorithms 9, 63–82 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kosowski, A., Kuszner, Ł. (2006). On Greedy Graph Coloring in the Distributed Model. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds) Euro-Par 2006 Parallel Processing. Euro-Par 2006. Lecture Notes in Computer Science, vol 4128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11823285_61
Download citation
DOI: https://doi.org/10.1007/11823285_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37783-2
Online ISBN: 978-3-540-37784-9
eBook Packages: Computer ScienceComputer Science (R0)