Broadcasting from multiple originators

DOI10.1016/j.dam.2009.02.013zbMath1209.94025OpenAlexW2024633871MaRDI QIDQ967331

Ladislav Stacho, Arthur L. Liestman, D. S. Richards

Publication date: 28 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2009.02.013

zbMATH Keywords

broadcastminimum broadcast graphmultiple originatorrelaxed broadcast

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Information theory (general) (94A15)

Related Items (3)

All-to-all broadcast problem of some classes of graphs under the half duplex all-port model ⋮ All-to-all broadcast problems on Cartesian product graphs ⋮ Minimum multiple originator broadcast graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum multiple originator broadcast graphs
• Sparse broadcast graphs
• Minimum broadcast graphs
• Compound constructions of broadcast networks
• Methods and problems of communication in usual networks
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• On the monotonicity of the broadcast function
• Lower bounds for the size in four families of minimum broadcast graphs
• More broadcast graphs
• The multiple originator broadcasting problem in graphs
• Fault-tolerant broadcast graphs
• A survey of gossiping and broadcasting in communication networks
• On the construction of minimal broadcast networks
• Minimal broadcast networks
• Information Dissemination in Trees
• Broadcasting in Trees with Multiple Originators
• Antepenultimate broadcasting
• Tight Bounds on Mimimum Broadcast Networks
• A new method for constructing minimal broadcast networks

This page was built for publication: Broadcasting from multiple originators