Distributed Graph Coloring: Fundamentals and Recent Developments by Leonid Baren
48,21 €
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.
Jetzt bei Ebay:
