Pages that link to "Item:Q856876"
From MaRDI portal
The following pages link to Optimal broadcast domination in polynomial time (Q856876):
Displaying 38 items.
- Exponential domination in subcubic graphs (Q504979) (← links)
- Dominating and irredundant broadcasts in graphs (Q507582) (← links)
- Broadcasts and domination in trees (Q539885) (← links)
- Bounds on the exponential domination number (Q729783) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- Radial trees (Q1045085) (← links)
- On the broadcast independence number of caterpillars (Q1752581) (← links)
- \(k\)-broadcast domination and \(k\)-multipacking (Q1801065) (← 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)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Algorithmic aspects of broadcast independence (Q2127617) (← links)
- Broadcasts on paths and cycles (Q2192097) (← links)
- 2-limited broadcast domination in subcubic graphs (Q2197488) (← links)
- Optimal domination polynomials (Q2227988) (← links)
- On the broadcast domination number of permutation graphs (Q2285130) (← links)
- Relating broadcast independence and independence (Q2329172) (← links)
- Broadcast domination and multipacking in strongly chordal graphs (Q2414458) (← links)
- On the broadcast independence number of grid graph (Q2441352) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
- Broadcast Domination in Graphs (Q3384108) (← links)
- General bounds on limited broadcast domination (Q4560266) (← links)
- (Q4622603) (← links)
- On the Complexity of Broadcast Domination and Multipacking in Digraphs (Q5041195) (← links)
- (Q5090528) (← links)
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs (Q5155707) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- Broadcast domination and multipacking: bounds and the integrality gap (Q5197586) (← links)
- Bounds on the sum of broadcast domination number and strong metric dimension of graphs (Q5216449) (← links)
- Asymptotically Optimal Bounds for (t,2) Broadcast Domination on Finite Grids (Q5235437) (← links)
- On the broadcast dimension of a graph (Q5883640) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897555) (← links)
- Minimizing setup in broadcast-optimal two round MPC (Q6061355) (← links)
- 2-limited broadcast domination on grid graphs (Q6110604) (← links)
- Global dominating broadcast in graphs (Q6174167) (← links)
- On the broadcast independence number of circulant graphs (Q6637055) (← links)
