Approximating the minimum rank of a graph via alternating projection (Q1785758): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2016.02.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2262040526 / rank | |||
Normal rank | |||
Revision as of 23:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the minimum rank of a graph via alternating projection |
scientific article |
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
