Reordered gossip schemes

DOI10.1016/0012-365X(94)00302-YzbMath0861.68065MaRDI QIDQ1923510

David W. Krumme

Publication date: 7 October 1996

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

zbMATH Keywords

gossip schemeslabel-connected graphsreordering theorem

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10)

Related Items

The epistemic gossip problem ⋮ Communication complexity of fault-tolerant information diffusion

Cites Work

• Label-connected graphs and the gossip problem
• Further gossip problems
• The communication problem on graphs
• Gossips and telegraphs
• Kernels of minimum size gossip schemes
• Information flows on hypergraphs
• Gossips and telephones
• The Communication Complexity of Atomic Commitment and of Gossiping
• A survey of gossiping and broadcasting in communication networks
• A Problem with Telephones
• Gossiping in Minimal Time
• A Cure for the Telephone Disease
• Unnamed Item
• Unnamed Item
• Unnamed Item