Tight Network Topology Dependent Bounds on Rounds of Communication

DOI10.1137/1.9781611974782.167zbMath1410.68030arXiv1608.03313OpenAlexW2514876211MaRDI QIDQ4575916

Atri Rudra, Arkadev Chattopadhyay, Shi Li, Michael Langberg

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.03313

Mathematics Subject Classification ID

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

This page was built for publication: Tight Network Topology Dependent Bounds on Rounds of Communication