Toward optimal gossiping schemes with conference calls

DOI10.1016/0166-218X(84)90065-9zbMath0529.05043OpenAlexW1968587703MaRDI QIDQ787168

Arthur L. Liestman, D. S. 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)

Related Items (2)

Information flows on hypergraphs ⋮ On Gossiping with Faulty Telephone Lines

Cites Work

• Unnamed Item
• Unnamed Item
• Further gossip problems
• The communication problem on graphs
• Gossips and telephones
• A Problem with Telephones
• Efficient Communication by Phone Calls
• A Cure for the Telephone Disease

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