Pages that link to "Item:Q958210"

The following pages link to Improved algorithms and complexity results for power domination in graphs (Q958210):

Displaying 26 items.

• Hybrid search for the optimal PMU placement problem on a power grid (Q319263) (← links)
• Generalized power domination of graphs (Q444434) (← links)
• Restricted power domination and fault-tolerant power domination on grids (Q708342) (← 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)
• Nordhaus-Gaddum problems for power domination (Q1627850) (← links)
• Note on power propagation time and lower bounds for the power domination number (Q1680484) (← links)
• Complexity and lowers bounds for power edge set problem (Q1711663) (← 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)
• Generalized power domination: propagation radius and Sierpiński graphs (Q2255613) (← links)
• The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
• Power domination throttling (Q2330105) (← links)
• Restricted power domination and zero forcing problems (Q2424658) (← 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)
• Minimum Power Dominating Sets of Random Cubic Graphs (Q5272639) (← links)
• The k-power bondage number of a graph (Q5298349) (← links)
• Power domination with bounded time constraints (Q5963647) (← links)
• \(k\)-power domination in block graphs (Q5963656) (← links)
• Leaf sector covers with applications on circle graphs (Q6549679) (← links)
• Hardness results of connected power domination for bipartite graphs and chordal graphs (Q6610089) (← links)