Pages that link to "Item:Q2429350"
From MaRDI portal
The following pages link to An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350):
Displaying 5 items.
- Hybrid search for the optimal PMU placement problem on a power grid (Q319263) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Power domination with bounded time constraints (Q5963647) (← links)
