Browsing by Subject "Bounded communication"
Now showing items 1-2 of 2
-
(Springer, 2015)In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and links may indicate telephone calls). ...
-
(Wiley-Blackwell, 2016)In the broadcast version of the congested clique model, n nodes communicate in synchronous rounds by writing O(log n)-bit messages on a whiteboard, which is visible to all of them. The joint input to the nodes is an ...