Pastāsti draugiem par šo preci:
Distributed Graph Coloring: Fundamentals and Recent Developments - Synthesis Lectures on Distributed Computing Theory Leonid Barenboim
Distributed Graph Coloring: Fundamentals and Recent Developments - Synthesis Lectures on Distributed Computing Theory
Leonid Barenboim
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).
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2013. gada 7. augusts |
| ISBN13 | 9783031008818 |
| Izdevēji | Springer International Publishing AG |
| Lapas | 157 |
| Izmēri | 190 × 234 × 16 mm · 334 g |
| Valoda | Angļu |