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

DOI10.1002/net.21662zbMath1386.68014OpenAlexW2183199496MaRDI QIDQ4638586

Pablo Moisset de Espanés, Ivan Rapaport, Daniel Remenik, Javiera Urrutia

Publication date: 27 April 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21662

zbMATH Keywords

parallelmessage passingdistributedgraph reconstructionBarabási-Albert networksbounded communicationbroadcast congested clique modelcluster and local computing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Network protocols (68M12)

This page was built for publication: Robust reconstruction of Barabási‐Albert networks in the broadcast congested clique model