The following pages link to Minimum \(k\)-broadcast graphs (Q1339891):
Displaying 14 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Minimum multiple originator broadcast graphs (Q516794) (← links)
- Bounded-call broadcasting (Q1339878) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- A new construction of broadcast graphs (Q2181251) (← links)
- The multiple originator broadcasting problem in graphs (Q2370417) (← links)
- Improved upper and lower bounds for \(k\)-broadcasting (Q2714909) (← links)
- An algorithm for constructing minimal \(c\)-broadcast networks (Q2747800) (← links)
- \(k\)-broadcasting in trees (Q2764999) (← links)
- A New Construction of Broadcast Graphs (Q2795946) (← links)
- Construction of minimum time-relaxed broadcasting communication networks (Q4798524) (← links)
- Some minimum gossip graphs (Q5289378) (← links)
- Broadcasting in weighted trees under the postal model (Q5964023) (← links)
- Finding broadcast 2-centers of a tree under the postal model (Q6585258) (← links)
