The number of rounds needed to exchange information within a graph

DOI10.1016/0166-218X(83)90065-3zbMath0519.05044WikidataQ126858719 ScholiaQ126858719MaRDI QIDQ1054746

Susan F. Assmann, Daniel J. Kleitman

Publication date: 1983

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

zbMATH Keywords

blocksradiusvertex-labellinginformation broadcasting

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Communication, information (94A99) Graph theory (05C99)

Cites Work

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

This page was built for publication: The number of rounds needed to exchange information within a graph