Optimal algorithms for broadcast and gossip in the edge-disjoint modes
type: Item
instance of: scholarly article
title: Optimal algorithms for broadcast and gossip in the edge-disjoint modes
zbMATH Open document ID: 0878.68070
author: Juraj Hromkovič
author: Ralf Klasing
author: Walter Unger
author: Hubert Wagener
published in: Information and Computation
publication date: 1998-01-04T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 1022243
zbMATH Keywords: gossip complexity
MaRDI profile type: Publication
full work available at URL: inco.1996.2618
OpenAlex ID: W1971853029
cites work: Parallel algorithms for gossiping by mail
cites work: Edge Separators of Planar and Outerplanar Graphs With Applications
cites work: Gossips and telegraphs
cites work: Minimum-time line broadcast networks
cites work: Optimal algorithms for dissemination of information in generalized communication modes
cites work: Optimal algorithms for dissemination of information in some interconnection networks
cites work: Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
cites work: Gossiping in Minimal Time
cites work: Broadcasting in butterfly and deBruijn networks
cites work: New gossips and telephones
cites work: Q4002466
DOI: 10.1006/INCO.1996.2618
Recommended article: Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
Recommended article: On the optimality of general lower bounds for broadcasting and gossiping
Recommended article: Optimal and near-optimal broadcast in random graphs
Recommended article: Q3359735
Recommended article: Optimal algorithms for dissemination of information in some interconnection networks
Recommended article: Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing
Recommended article: Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
Recommended article: Optimal broadcast for fully connected processor-node networks
description: scientific article; zbMATH DE number 1022243