Algorithms and complexity of power domination in graphs (Q3384121)
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 7444912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and complexity of power domination in graphs |
scientific article; zbMATH DE number 7444912 |
Statements
Algorithms and Complexity of Power Domination in Graphs (English)
0 references
14 December 2021
0 references
power domination number
0 references
complexity of computing
0 references
0 references
0 references
0.8573380708694458
0 references
0.8556951880455017
0 references
0.854058563709259
0 references
0.8539326190948486
0 references
0.8449921011924744
0 references
