Broadcasting from multiple originators
From MaRDI portal
Publication:967331
DOI10.1016/J.DAM.2009.02.013zbMATH Open1209.94025OpenAlexW2024633871MaRDI QIDQ967331FDOQ967331
Ladislav Stacho, Arthur L. Liestman, Dana 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
Applications of graph theory (05C90) Information theory (general) (94A15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- Sparse broadcast graphs
- Minimum broadcast graphs
- Compound constructions of broadcast networks
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- On the monotonicity of the broadcast function
- More broadcast 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
- Antepenultimate broadcasting
- Tight Bounds on Mimimum Broadcast Networks
- Methods and problems of communication in usual networks
- Title not available (Why is that?)
- Lower bounds for the size in four families of minimum broadcast graphs
- The multiple originator broadcasting problem in graphs
- Broadcasting in Trees with Multiple Originators
- Minimum multiple originator broadcast graphs
- A new method for constructing minimal broadcast networks
Cited In (4)
Recommendations
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)