Pages that link to "Item:Q5901134"
From MaRDI portal
The following pages link to Approximation Algorithms and Hardness for Domination with Propagation (Q5901134):
Displayed 22 items.
- Hybrid search for the optimal PMU placement problem on a power grid (Q319263) (← links)
- Generalized power domination of graphs (Q444434) (← links)
- Power domination in regular claw-free graphs (Q777411) (← links)
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← links)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
- Power domination in circular-arc graphs (Q1939660) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← links)
- Disproofs of three conjectures on the power domination of graphs (Q2057589) (← links)
- Generalized power domination in claw-free regular graphs (Q2117535) (← links)
- On the harmless set problem parameterized by treewidth (Q2154099) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Generalized power domination: propagation radius and Sierpiński graphs (Q2255613) (← links)
- The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Techniques for determining equality of the maximum nullity and the zero forcing number of a graph (Q4989750) (← links)
- Minimum Power Dominating Sets of Random Cubic Graphs (Q5272639) (← links)
- Vertex sequences in graphs (Q5862692) (← links)
- Power domination with bounded time constraints (Q5963647) (← links)
- \(k\)-power domination in block graphs (Q5963656) (← links)