Clique Here: On the Distributed Complexity in Fully-Connected Networks

DOI10.1142/S0129626416500043zbMath1376.68018MaRDI QIDQ4598914

Benny Applebaum, Adi Rosén, Dariusz R. Kowalski, Boaz Patt-Shamir

Publication date: 15 December 2017

Published in: Parallel Processing Letters (Search for Journal in Brave)

zbMATH Keywords

network algorithmscommunication complexitypointer jumpingCONGEST model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

This page was built for publication: Clique Here: On the Distributed Complexity in Fully-Connected Networks