Hardness results of connected power domination for bipartite graphs and chordal graphs (Q6610089)
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: Hardness results of connected power domination for bipartite graphs and chordal graphs |
scientific article; zbMATH DE number 7918138
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness results of connected power domination for bipartite graphs and chordal graphs |
scientific article; zbMATH DE number 7918138 |
Statements
Hardness results of connected power domination for bipartite graphs and chordal graphs (English)
0 references
24 September 2024
0 references
domination
0 references
connected power domination
0 references
polynomial-time algorithm
0 references
NP-complete
0 references
graph algorithm
0 references
0 references
