Abstract
Vertex coloring is an assignment of colors to the vertices of a graph such that there are no two neighbor nodes having the same color. Vertex coloring has many applications such as task scheduling, register allocation, and channel frequency assignment. In this chapter, we investigate distributed vertex coloring algorithms for arbitrary graphs and trees.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Appel K, Haken W (1977) Solution of the four color map problem. Sci Am 237(4):108–121
Barenboim L, Elkin M (2010) Deterministic distributed vertex coloring polylogarithmic time. In: Proc 29th annual ACM symposium on principles of distributed computing (PODC), Zurich, Switzerland. ACM, New York, pp 410–419
Bollobas B (1979) Graph theory. Springer, New York
Ghosh S, Karaata MH (1993) A self-stabilizing algorithm for coloring planar graphs. Distrib Comput 7:55–59
Goldberg AV, Plotkin SA, Shannon GE (1988) Parallel symmetrybreaking in sparse graphs. SIAM J Discrete Math 1(4):434–446
Grable D, Panconesi A (1997) Nearly optimal distributed edge-coloring in O(loglogn) rounds. Random Struct Algorithms 10(3):385–405
Hedetniemi ST, Jacobs DP, Srimani PK (2003) Linear time self-stabilizing colorings. Inf Process Lett 87:251–255
Johansson O (1999) Simple distributed Δ+1 coloring of graphs. Inf Process Lett 70(5):229–232
Karp RM (1991) Probabilistic recurrence relations. In: Proc 23rd annual ACM symposium on theory of computing (STOC 91), pp 190–197
Kuhn F (2009) Weak graph colorings. In: Proc 21st annual ACM symposium on parallelism in algorithms and architectures. ACM, New York, pp 138–144
Linial N (1992) Locality in distributed graph algorithms. SIAM J Comput 21(1):193–201
Luby M (1993) Removing randomness in parallel computation without a processor penalty. J Comput Syst Sci 47:250–286
Marathe V, Panconesi A, Risinger LD Jr (2000) An experimental study of a simple, distributed edge coloring algorithm. In: Proc SPAA 2000, pp 166–175
Panconesi A, Rizzi R (2001) Some simple distributed algorithms for sparse networks. Distrib Comput 14(2):97–100
Peleg D (2000) Distributed computing: a locality-sensitive approach. SIAM, Philadelphia. ISBN: 0-89871-464-8
Skiena SS (2008) The algorithm design manual, 2nd edn. Springer, Berlin. ISBN: 1-84800-069–978-1-84800-8. Chapter 16
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Erciyes, K. (2013). Vertex Coloring. In: Distributed Graph Algorithms for Computer Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-4471-5173-9_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5173-9_9
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5172-2
Online ISBN: 978-1-4471-5173-9
eBook Packages: Computer ScienceComputer Science (R0)