Compound constructions of broadcast networks
From MaRDI portal
Publication:1296577
DOI10.1016/S0166-218X(99)00043-8zbMath0941.90009MaRDI QIDQ1296577
Michael J. Dinneen, José A. Ventura, Golbon Zakeri, Mark C. Wilson
Publication date: 2 August 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C90: Applications of graph theory
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
94A05: Communication theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse broadcast graphs
- Minimum broadcast graphs
- Methods and problems of communication in usual networks
- A minimum broadcast graph on 63 vertices
- Some minimum broadcast graphs
- Lower bounds for the size in four families of minimum 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 Bounded Degree Graphs
- Antepenultimate broadcasting
- Tight Bounds on Mimimum Broadcast Networks
- Some minimum gossip graphs
- A new method for constructing minimal broadcast networks