Note on optimal gossiping in some weak-connected graphs

DOI10.1016/0304-3975(94)90049-3zbMath0824.68010OpenAlexW2061095717MaRDI QIDQ1342244

Juraj Hromkovič, Claus-Dieter Jeschke, Burkhard Monien

Publication date: 9 February 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90049-3

zbMATH Keywords

gossip problemweak-connected graphs

Mathematics Subject Classification ID

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

Related Items (3)

Effective systolic algorithms for gossiping in cycles and two-dimensional grids ⋮ The complexity of systolic dissemination of information in interconnection networks ⋮ Communication complexity of fault-tolerant information diffusion

Cites Work

• Parallel algorithms for gossiping by mail
• Broadcasting in the butterfly network
• New gossips and telephones
• Gossips and telegraphs
• Optimal algorithms for dissemination of information in some interconnection networks
• Gossips and telephones
• Generalizations of broadcasting and gossiping
• A survey of gossiping and broadcasting in communication networks
• Broadcast Networks of Bounded Degree
• Gossiping in Minimal Time
• Fast Gossiping for the Hypercube
• Broadcasting in butterfly and debruijn networks
• A Cure for the Telephone Disease
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on optimal gossiping in some weak-connected graphs