23 Dez
2004
23 Dez
'04
10:44
The following technical report is available from http://aib.informatik.rwth-aachen.de/:
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
Parameterized Power Domination Complexity 2004-09
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.
Regards, Volker