Distributed graph coloring : fundamentals and recent developments
The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. In this model a communication network is represented by a n -vertex graph G = (V, E), whose vertices host autonomous processors. The processors communicate over the edges of G in discrete rounds. The goal is to devise algorithms that use as few rounds as possible
หนังสืออิเล็กทรอนิกส์, English, ©2013
Springer, Cham, Switzerland, ©2013