Degree- and time-constrained broadcast networks
From MaRDI portal
Publication:4537618
DOI10.1002/net.10018zbMath1027.90011MaRDI QIDQ4537618
Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wilson
Publication date: 1 July 2002
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10018
05C90: Applications of graph theory
90B18: Communication networks in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Cites Work
- Unnamed Item
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
- Sparse broadcast graphs
- Compound constructions of broadcast networks
- Broadcasting on recursively decomposable Cayley graphs
- Bounded depth broadcasting
- Interconnection Networks Based on a Generalization of Cube-Connected Cycles
- A survey of gossiping and broadcasting in communication networks
- Minimal broadcast networks
- New results for the degree/diameter problem
- Approximation Algorithms for Minimum-Time Broadcast