Toward optimal gossiping schemes with conference calls

DOI10.1016/0166-218X(84)90065-9MaRDI QIDQ787168zbMATH OpenOpenAlexFDO

Authors Arthur L. Liestman, Dana Richards

Publication date 1984

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(84)90065-9

zbMATH Keywords

gossipk-person conference callsminimum calling scheme

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Communication, information (94A99)

Cites work

• scientific article; zbMATH DE number 3641489 (Why is no real title available?)
• scientific article; zbMATH DE number 3358479 (Why is no real title available?)
• A Cure for the Telephone Disease
• A Problem with Telephones
• Efficient Communication by Phone Calls
• Further gossip problems
• Gossips and telephones
• The communication problem on graphs

Cited in

(2)

• On Gossiping with Faulty Telephone Lines
• Information flows on hypergraphs

This page was built for publication: Toward optimal gossiping schemes with conference calls

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