Fast Gossiping for the Hypercube
From MaRDI portal
Publication:3990659
DOI10.1137/0221026zbMath0747.68010OpenAlexW2068889991MaRDI QIDQ3990659
Publication date: 28 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/dba630339d5833d3f8434954d50d6e55a07f5478
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
Fast gossiping with short unreliable messages ⋮ Methods and problems of communication in usual networks ⋮ Note on the problem of gossiping in multidimensional grids ⋮ Note on optimal gossiping in some weak-connected graphs ⋮ Oriented hypercubes ⋮ Optimal gossiping in square 2D meshes ⋮ Gossiping with multiple sends and receives ⋮ Bounds for the oriented diameter of planar triangulations ⋮ Deterministic broadcasting time with partial knowledge of the network. ⋮ Reliable Broadcasting in Hypercubes with Random Link and Node Failures ⋮ Optimal gossiping in paths and cycles ⋮ Graph theoretical issues in computer networks
This page was built for publication: Fast Gossiping for the Hypercube
