Hierarchical broadcast networks

DOI10.1016/S0020-0190(98)00179-3MaRDI QIDQ293474zbMATH OpenOpenAlexFDO

Authors Pierre Fraigniaud

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019098001793?np=y

zbMATH Keywords

broadcastinggossipingminimum broadcast graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18)

Recommendations

• Hierarchical broadcast and gossip networks
• Tight Bounds on Mimimum Broadcast Networks
• Broadcast networks with near optimal cost
• A new method for constructing minimal broadcast networks
• On the construction of minimal broadcast networks

Cites work

• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• A survey of gossiping and broadcasting in communication networks
• Antepenultimate broadcasting
• Methods and problems of communication in usual networks
• Some minimum gossip graphs
• Tight Bounds on Mimimum Broadcast Networks

Cited in

(2)

• On the number of broadcast schemes in networks
• Hierarchical broadcast and gossip networks

This page was built for publication: Hierarchical broadcast networks

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