The minimum rank completion problems for tri-diagonal partial full sign patterns (Q3132031)
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 6831484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum rank completion problems for tri-diagonal partial full sign patterns |
scientific article; zbMATH DE number 6831484 |
Statements
29 January 2018
0 references
full sign pattern
0 references
signed bipartite graph
0 references
bipartite zero forcing number
0 references
minimum rank completion problem
0 references
0.8110175728797913
0 references
0.7999722361564636
0 references
0.7885714173316956
0 references
0.7885714173316956
0 references
