randomized distributed algorithm for vertex coloring
Many computational tasks require the cooperation of many processors in the network, but prohibit certain processors pair (or large group) from operating simultaneously. This symmetry breaking technique play a major role in distributed network algorithm. Two symmetry breaking task of "localized" nature are coloring (Vertex Coloring) and Maximal Independence Set (MIS). In this paper, we present an experimental analysis of simple and elegant randomized distributed algorithm for vertex coloring problem
randomization distributed algorithm vertex coloring maximal independent set graph theory