Optimal algorithms for dissemination of information in some interconnection networks

DOI10.1007/BF01908630zbMath0773.68007OpenAlexW2088523482MaRDI QIDQ1261287

Juraj Hromkovič, Claus-Dieter Jeschke, Burkhard Monien

Publication date: 1 September 1993

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01908630

zbMATH Keywords

lower boundinterconnection networksgossipingbroadcastingone-way communication

Mathematics Subject Classification ID

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

Related Items (5)

Gossiping and broadcasting versus computing functions in networks ⋮ Note on optimal gossiping in some weak-connected graphs ⋮ Optimal algorithms for broadcast and gossip in the edge-disjoint modes ⋮ Gossiping and broadcasting versus computing functions in networks. ⋮ The shortest path problem in the Knödel graph

Cites Work

• Unnamed Item
• Parallel algorithms for gossiping by mail
• Broadcasting in the butterfly network
• Gossips and telegraphs
• Gossips and telephones
• Generalizations of broadcasting and gossiping
• A survey of gossiping and broadcasting in communication networks
• Broadcast Networks of Bounded Degree
• A Cure for the Telephone Disease

This page was built for publication: Optimal algorithms for dissemination of information in some interconnection networks