The PMU Placement Problem

DOI10.1137/S0895480103432556zbMath1103.90081OpenAlexW2001630194MaRDI QIDQ5470792

Lenwood S. Heath, Dennis J. Brueni

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480103432556

zbMATH Keywords

NP-completenessdominationphasor measurement unitelectric power monitoringpower system graph observability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Applications of graph theory to circuits and networks (94C15)

Related Items

Hybrid search for the optimal PMU placement problem on a power grid, Observing the State of a Smart Grid Using Bilevel Programming, Observability of power systems with optimal PMU placement, Improved Computational Approaches and Heuristics for Zero Forcing, Throttling processes equivalent to full throttling on trees, Power domination in the generalized Petersen graphs, Complexity of domination in triangulated plane graphs, Note on power propagation time and lower bounds for the power domination number, Power domination on permutation graphs, New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts, Solving the multistage PMU placement problem by integer programming and equivalent network design model, Restricted power domination and zero forcing problems, Power domination in circular-arc graphs, Connected power domination in graphs, An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}, Unnamed Item, Unnamed Item, Power domination in certain chemical structures, Complexity and inapproximability results for the power edge set problem, Improved algorithms and complexity results for power domination in graphs, On the error of \textit{a priori} sampling: zero forcing sets and propagation time, Generalized power domination: propagation radius and Sierpiński graphs, Restricted power domination and fault-tolerant power domination on grids, Failed power domination on graphs, Domination in graphs with bounded propagation: Algorithms, formulations and hardness results, Algorithms and applications for a class of bilevel MILPs, Infectious power domination of hypergraphs, Power domination with bounded time constraints, On a conjecture for power domination, Unnamed Item, Algorithms and Complexity of Power Domination in Graphs, Product throttling, Power domination throttling, Vertex sequences in graphs