Approximating the minimum rank of a graph via alternating projection (Q1785758)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating the minimum rank of a graph via alternating projection |
scientific article; zbMATH DE number 6945866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the minimum rank of a graph via alternating projection |
scientific article; zbMATH DE number 6945866 |
Statements
Approximating the minimum rank of a graph via alternating projection (English)
0 references
1 October 2018
0 references
minimum rank of a graph
0 references
alternating projections
0 references
heuristics
0 references
zero-forcing
0 references
0 references
0 references
0 references
0 references
0.7384637594223022
0 references
0.7254834175109863
0 references
0.7238937616348267
0 references
0.7174545526504517
0 references
