Parameterized power domination complexity

Authors:
Joachim Kneis;Daniel Mölle;Stefan Richter;Peter Rossmanith
Affiliations:
Department of Computer Science, RWTH Aachen University, Germany;Department of Computer Science, RWTH Aachen University, Germany;Department of Computer Science, RWTH Aachen University, Germany;Department of Computer Science, RWTH Aachen University, Germany
Venue:
Information Processing Letters
Year:
2006

Citing 6
Cited 4

Fixed-parameter tractability and completeness III: some structural aspects of the W hierarchy

Complexity theory
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

Approximation Algorithms and Hardness for Domination with Propagation

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Restricted power domination and fault-tolerant power domination on grids

Discrete Applied Mathematics
On the power domination number of the generalized Petersen graphs

Journal of Combinatorial Optimization
Generalized power domination of graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

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.