The following pages link to The PMU Placement Problem (Q5470792):
Displaying 36 items.
- Hybrid search for the optimal PMU placement problem on a power grid (Q319263) (← links)
- Power domination in certain chemical structures (Q491607) (← links)
- Restricted power domination and fault-tolerant power domination on grids (Q708342) (← 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)
- Observability of power systems with optimal PMU placement (Q1652693) (← links)
- Note on power propagation time and lower bounds for the power domination number (Q1680484) (← links)
- Complexity and inapproximability results for the power edge set problem (Q1743493) (← links)
- Power domination in circular-arc graphs (Q1939660) (← links)
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time (Q2002553) (← links)
- On a conjecture for power domination (Q2042204) (← links)
- Product throttling (Q2073191) (← links)
- Power domination in the generalized Petersen graphs (Q2175230) (← links)
- Complexity of domination in triangulated plane graphs (Q2178742) (← links)
- Generalized power domination: propagation radius and Sierpiński graphs (Q2255613) (← links)
- Algorithms and applications for a class of bilevel MILPs (Q2283108) (← links)
- Infectious power domination of hypergraphs (Q2286585) (← links)
- Power domination throttling (Q2330105) (← links)
- Power domination on permutation graphs (Q2416432) (← links)
- Solving the multistage PMU placement problem by integer programming and equivalent network design model (Q2423817) (← links)
- Restricted power domination and zero forcing problems (Q2424658) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- Throttling processes equivalent to full throttling on trees (Q2661773) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Observing the State of a Smart Grid Using Bilevel Programming (Q3467857) (← links)
- Optimal PMU placement problem in octahedral networks (Q5053891) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- Failed power domination on graphs (Q5109066) (← links)
- (Q5322839) (← links)
- (Q5374237) (← links)
- Vertex sequences in graphs (Q5862692) (← links)
- Product throttling for power domination (Q5883635) (← links)
- Power domination with bounded time constraints (Q5963647) (← links)
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts (Q6065861) (← links)
- Minimal zero forcing sets (Q6644905) (← links)
