Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model

Abstract

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 undirected n-node graph G, with node i receiving the list of its neighbors in G. Our goal is to design a protocol at the end of which the… (More)
DOI: 10.1002/net.21662

Topics

3 Figures and Tables

Slides referencing similar topics