On the complexity of the positive semidefinite zero forcing number (Q5962481)
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 6541262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the positive semidefinite zero forcing number |
scientific article; zbMATH DE number 6541262 |
Statements
On the complexity of the positive semidefinite zero forcing number (English)
0 references
12 February 2016
0 references
positive zero forcing number
0 references
clique cover number
0 references
chordal graphs
0 references
computational complexity
0 references
0 references
0 references
0.96382153
0 references
0 references
0.92102736
0 references
0.9195462
0 references
0.91559714
0 references
0.91109973
0 references
0.8993611
0 references
0.8939779
0 references
0.8932054
0 references
