Quick Gossiping by Conference Calls

DOI10.1137/0401013MaRDI QIDQ3032285zbMATH OpenOpenAlexFDO

Authors Ákos Seress

Publication date 1988

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

calling schemegossip problemlabeled hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 3849231
• Quick gossiping by telegraphs
• Fast Gossiping by Short Messages
• Fast gossiping by short messages
• scientific article; zbMATH DE number 15364
• Gossiping in Minimal Time
• Faster rumor spreading with multiple calls
• Faster rumor spreading with multiple calls
• On Gossiping with Faulty Telephone Lines
• Quick gossiping without duplicate transmissions

Cited in

(6)

• The addition game: An abstraction of a communication problem
• Improved bounds for minimum fault-tolerant gossip graphs
• scientific article; zbMATH DE number 3849231 (Why is no real title available?)
• Gossiping in Minimal Time
• Fast Gossiping by Short Messages
• Time and Cost Trade-Offs in Gossiping

This page was built for publication: Quick Gossiping by Conference Calls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3032285)