Gossiping without Duplicate Transmissions

DOI10.1137/0603042zbMath0497.05039OpenAlexW2110645612MaRDI QIDQ3960730

Douglas B. West

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0603042

zbMATH Keywords

gossip problemcalling scheme

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99) Communication theory (94A05)

Related Items (5)

Quick gossiping without duplicate transmissions ⋮ The addition game: An abstraction of a communication problem ⋮ Asymptotically optimal gossiping in radio networks ⋮ Improved Bounds for Minimum Fault-Tolerant Gossip Graphs ⋮ A class of solutions to the gossip problem. III

Cites Work

• Unnamed Item
• A class of solutions to the gossip problem. III
• Further gossip problems
• A class of solutions to the gossip problem. I
• Gossips and telephones
• A Problem with Telephones

This page was built for publication: Gossiping without Duplicate Transmissions