Distributed Graph Coloring

Discover the intriguing world of distributed computing with Distributed Graph Coloring by Leonid Barenboim. Published by Springer International Publishing AG in 2013, this insightful monograph spans 157 pages and delves into the complexities of symmetry breaking problems within the message-passing model.

This book primarily addresses the challenges of graph coloring, a fundamental issue in distributed systems. It also explores other significant symmetry-breaking problems, including the computation of a maximal independent set (MIS) and maximal matching (MM). Whether you are a researcher, student, or professional in the field of computer science, this work provides valuable insights and methodologies essential for understanding distributed algorithms. Enhance your knowledge and skills in distributed computing with this essential read.