Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model
From MaRDI portal
Publication:4714557
DOI10.1137/S0097539793252870zbMath0860.05052OpenAlexW2026395075MaRDI QIDQ4714557
Satoshi Fujita, Masafumi Yamashita
Publication date: 21 April 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539793252870
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Parallel algorithms in computer science (68W10)
Related Items (2)
An online distributed gossiping protocol for mobile networks ⋮ Optimal serial broadcast of successive chunks
This page was built for publication: Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model