Pages that link to "Item:Q1199443"
From MaRDI portal
The following pages link to Broadcasting in DMA-bound bounded degree graphs (Q1199443):
Displaying 12 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Broadcasting in DMA-bound bounded degree graphs (Q1199443) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- Minimum \(k\)-broadcast graphs (Q1339891) (← links)
- Bounded depth broadcasting (Q1917294) (← links)
- Improved upper and lower bounds fork-broadcasting (Q2714909) (← links)
- An algorithm for constructing minimalc-broadcast networks (Q2747800) (← links)
- k-Broadcasting in trees (Q2764999) (← 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)
- New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs (Q6496344) (← links)
