Pages that link to "Item:Q844180"
From MaRDI portal
The following pages link to Parameterized power domination complexity (Q844180):
Displayed 22 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)
- On the power domination number of the generalized Petersen graphs (Q719033) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Editorial: Tails and ties (Q978797) (← links)
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← links)
- Power domination in circular-arc graphs (Q1939660) (← 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)
- Power domination throttling (Q2330105) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- Power domination in cylinders, tori, and generalized Petersen graphs (Q3113506) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Power domination in honeycomb networks (Q4648989) (← links)
- Power domination in Mycielskian of spiders (Q5097786) (← links)
- Failed power domination on graphs (Q5109066) (← links)
- Minimum Power Dominating Sets of Random Cubic Graphs (Q5272639) (← links)
- Power domination with bounded time constraints (Q5963647) (← links)
- \(k\)-power domination in block graphs (Q5963656) (← links)