Pages that link to "Item:Q5897555"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5897555):
Displaying 9 items.
- Optimal broadcast domination in polynomial time (Q856876) (← links)
- All-to-all broadcast problems on Cartesian product graphs (Q897889) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
- General bounds on limited broadcast domination (Q4560266) (← links)
- (Q4622603) (← 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)
- Asymptotically Optimal Bounds for (t,2) Broadcast Domination on Finite Grids (Q5235437) (← links)
- Approximation algorithms in graphs with known broadcast time of the base graph (Q6102286) (← links)