The following pages link to \(k\)-broadcasting in trees (Q2764999):
Displaying 10 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model (Q400494) (← links)
- The shared broadcast tree problem and MST (Q510900) (← links)
- Broadcasts and domination in trees (Q539885) (← links)
- All-to-all broadcast problems on Cartesian product graphs (Q897889) (← links)
- (Q4604110) (← links)
- A linear algorithm for finding the <i>k</i>‐broadcast center of a tree (Q5191149) (← links)
- Broadcasting in weighted trees under the postal model (Q5964023) (← links)
- New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs (Q6496344) (← links)
- Finding broadcast 2-centers of a tree under the postal model (Q6585258) (← links)
