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 the normal view instead:
scientific article; zbMATH DE number 7918138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8516371250152588
0 references
0.8305817246437073
0 references
0.8236789107322693
0 references
0.8195393681526184
0 references
0.8167444467544556
0 references
