Distributed Graph Coloring
42.50
The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. A typical symmetry-breaking problem is the problem of graph coloring. Other typical symmetry-breaking problems are the problems of computing a maximal independent set (MIS) and a maximal matching (MM).

0 | 0