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 10 items.
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model (Q400494) (← links)
- Broadcasting on cactus graphs (Q512890) (← links)
- All-to-all broadcast problems on Cartesian product graphs (Q897889) (← links)
- The complexity of finding a broadcast center (Q2151362) (← links)
- \(k\)-broadcasting in trees (Q2764999) (← links)
- A Linear Time Algorithm for Finding ak-Tree Core (Q4339005) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- Broadcasting in weighted trees under the postal model (Q5964023) (← links)
- Finding broadcast 2-centers of a tree under the postal model (Q6585258) (← links)
- Upper bounds and approximation results for the \(k\)-slow burning problem (Q6671389) (← links)