Pages that link to "Item:Q2714909"
From MaRDI portal
The following pages link to Improved upper and lower bounds for \(k\)-broadcasting (Q2714909):
Displaying 17 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)
- Tight lower bounds on broadcast function for \(n = 24\) and 25 (Q401149) (← links)
- Upper bounds on the broadcast function using minimum dominating sets (Q456886) (← links)
- All-to-all broadcast problems on Cartesian product graphs (Q897889) (← links)
- Improved lower bound on broadcast function based on graph partition (Q1642698) (← links)
- On the monotonicity of the broadcast function (Q1868844) (← links)
- A new construction of broadcast graphs (Q2181251) (← links)
- \(k\)-broadcasting in trees (Q2764999) (← links)
- An upper bound on the \(k\)-modem illumination problem (Q2792799) (← links)
- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs (Q2971647) (← links)
- Lower Bounds for the Noisy Broadcast Problem (Q3549324) (← 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)
- A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm (Q6082271) (← links)
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs (Q6103475) (← links)
- New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs (Q6496344) (← links)
