The following pages link to Computing and Combinatorics (Q5717005):
Displaying 29 items.
- Generalized power domination of graphs (Q444434) (← links)
- Power domination in certain chemical structures (Q491607) (← links)
- Restricted power domination and fault-tolerant power domination on grids (Q708342) (← links)
- On the power domination number of the generalized Petersen graphs (Q719033) (← links)
- Power domination in regular claw-free graphs (Q777411) (← links)
- Power domination on triangular grids with triangular and hexagonal shape (Q782760) (← links)
- On the \({k}\)-power domination of hypergraphs (Q887853) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← links)
- Power domination in circular-arc graphs (Q1939660) (← links)
- Disproofs of three conjectures on the power domination of graphs (Q2057589) (← links)
- Generalized power domination in claw-free regular graphs (Q2117535) (← links)
- Hardness results of connected power domination for bipartite graphs and chordal graphs (Q2150586) (← links)
- Power domination in the generalized Petersen graphs (Q2175230) (← links)
- The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
- Power domination throttling (Q2330105) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- Power domination on permutation graphs (Q2416432) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- On the Power Domination Number of Graph Products (Q2795962) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Power domination number of sunlet graph and other graphs (Q5036755) (← links)
- Power domination in Mycielskian of spiders (Q5097786) (← links)
- Power domination with bounded time constraints (Q5963647) (← links)
- \(k\)-power domination in block graphs (Q5963656) (← links)
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts (Q6065861) (← links)
- Labeling algorithm for power domination problem of trees (Q6096257) (← links)
- 2-power domination number for Knödel graphs and its application in communication networks (Q6181254) (← links)
