Pages that link to "Item:Q5191137"
From MaRDI portal
The following pages link to A linear‐time algorithm for broadcast domination in a tree (Q5191137):
Displaying 15 items.
- Dominating and irredundant broadcasts in graphs (Q507582) (← links)
- Broadcasts and domination in trees (Q539885) (← links)
- Radial trees (Q1045085) (← links)
- On the broadcast independence number of caterpillars (Q1752581) (← links)
- New bounds for the broadcast domination number of a graph (Q1955610) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- Broadcast domination in subcubic graphs (Q2093109) (← links)
- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles (Q2112664) (← links)
- Algorithmic aspects of broadcast independence (Q2127617) (← links)
- Broadcasts on paths and cycles (Q2192097) (← links)
- 2-limited broadcast domination in subcubic graphs (Q2197488) (← links)
- Broadcast domination and multipacking in strongly chordal graphs (Q2414458) (← links)
- On the broadcast independence number of grid graph (Q2441352) (← links)
- Broadcast Domination in Graphs (Q3384108) (← links)
- 2-limited broadcast domination on grid graphs (Q6110604) (← links)
