Information flows on hypergraphs

DOI10.1016/0012-365X(93)90509-RzbMath0771.05075OpenAlexW2072174196MaRDI QIDQ2366011

Roger Labahn

Publication date: 29 June 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90509-r

zbMATH Keywords

upper boundsinformationhypergraphsgossip problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumerative combinatorics (05A99)

Related Items

Methods and problems of communication in usual networks ⋮ Kernels of minimum size gossip schemes ⋮ Reordered gossip schemes ⋮ Quick gossiping by telegraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Toward optimal gossiping schemes with conference calls
• A class of solutions to the gossip problem. III
• Further gossip problems
• Generalizations of broadcasting and gossiping
• A survey of gossiping and broadcasting in communication networks
• A Problem with Telephones
• Efficient Communication by Phone Calls