Complexity and computation of connected zero forcing (Q2012050)
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 6754389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and computation of connected zero forcing |
scientific article; zbMATH DE number 6754389 |
Statements
Complexity and computation of connected zero forcing (English)
0 references
27 July 2017
0 references
connected zero forcing
0 references
zero forcing
0 references
NP-completeness
0 references
unicyclic graph
0 references
cactus graph
0 references
block graph
0 references
0 references
0 references
0 references
0 references
0.8299228549003601
0 references
0.821492075920105
0 references
0.818019449710846
0 references
0.815911054611206
0 references
0.812804639339447
0 references
