Improved algorithms and complexity results for power domination in graphs (Q958210)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved algorithms and complexity results for power domination in graphs |
scientific article; zbMATH DE number 5377141
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved algorithms and complexity results for power domination in graphs |
scientific article; zbMATH DE number 5377141 |
Statements
Improved algorithms and complexity results for power domination in graphs (English)
0 references
2 December 2008
0 references
design and analysis of algorithms
0 references
computational complexity
0 references
parameterized complexity
0 references
fixed-parameter algorithms
0 references
graph algorithms
0 references
graphs of bounded treewidth
0 references
power domination in graphs
0 references
