Quick gossiping without duplicate transmissions

DOI10.1007/BF01788111zbMath0601.05029OpenAlexW2085032658MaRDI QIDQ1080864

Seress, Ákos

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

gossip problem

Mathematics Subject Classification ID

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

Related Items (5)

The addition game: An abstraction of a communication problem ⋮ Asymptotically optimal gossiping in radio networks ⋮ Unnamed Item ⋮ The logic of gossiping ⋮ Set to set broadcasting in communication networks

Cites Work

• Unnamed Item
• Unnamed Item
• A class of solutions to the gossip problem. III
• Gossiping old ladies
• Further gossip problems
• A class of solutions to the gossip problem. I
• The communication problem on graphs
• Gossips and telephones
• Gossiping without Duplicate Transmissions
• A Problem with Telephones
• Efficient Communication by Phone Calls
• A Cure for the Telephone Disease

This page was built for publication: Quick gossiping without duplicate transmissions