Pages that link to "Item:Q5191149"
From MaRDI portal
The following pages link to A linear algorithm for finding the <i>k</i>‐broadcast center of a tree (Q5191149):
Displaying 4 items.
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model (Q400494) (← links)
- All-to-all broadcast problems on Cartesian product graphs (Q897889) (← links)
- The complexity of finding a broadcast center (Q2151362) (← links)
- Broadcasting in weighted trees under the postal model (Q5964023) (← links)
