Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- A new method for constructing minimal broadcast networks
- A survey of gossiping and broadcasting in communication networks
- Antepenultimate broadcasting
- Broadcasting in Trees with Multiple Originators
- Compound constructions of broadcast networks
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Fault-tolerant broadcast graphs
- Information Dissemination in Trees
- Lower bounds for the size in four families of minimum broadcast graphs
- Methods and problems of communication in usual networks
- Minimal broadcast networks
- Minimum broadcast graphs
- Minimum multiple originator broadcast graphs
- More broadcast graphs
- On the construction of minimal broadcast networks
- On the monotonicity of the broadcast function
- Sparse broadcast graphs
- The multiple originator broadcasting problem in graphs
- Tight Bounds on Mimimum Broadcast Networks
Cited in
(6)- Multi-messages broadcasting in simultaneously send/receive communication networks
- The multiple originator broadcasting problem in graphs
- 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
- Simultaneous broadcast revisited
- Minimum multiple originator broadcast graphs
This page was built for publication: Broadcasting from multiple originators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967331)