| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428936 | Information Processing Letters | 2006 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
