On the structure of parameterized problems in NP
Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Domination in Graphs Applied to Electric Power Networks
SIAM Journal on Discrete Mathematics
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.89 |
The optimization problem of measuring all nodes in an electrical network by placing as few measurement units (PMUs) as possible is known as POWER DOMINATING SET. Nodes can be measured indirectly according to Kirchhoff's law. We show that this problem can be solved in linear time for graphs of bounded treewidth and establish bounds on its parameterized complexity if the number of PMUs is the parameter.