Pages that link to "Item:Q2369649"
From MaRDI portal
The following pages link to An efficient heuristic for broadcasting in networks (Q2369649):
Displaying 8 items.
- Broadcasting on cactus graphs (Q512890) (← links)
- On broadcasting in unicyclic graphs (Q1029711) (← links)
- Rumor spreading with bounded in-degree (Q2292916) (← 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)
- Tighter bounds on the minimum broadcast time (Q6122083) (← links)
- A note to non-adaptive broadcasting (Q6536205) (← links)
- Strong bounds and exact solutions to the minimum broadcast time problem (Q6609717) (← links)
