Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs (Q2020704)
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: Rank decomposition under zero pattern constraints and L-free directed graphs |
scientific article; zbMATH DE number 7337673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs |
scientific article; zbMATH DE number 7337673 |
Statements
Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs (English)
0 references
24 April 2021
0 references
block (upper triangular) matrices
0 references
additive decomposition
0 references
rank constraints
0 references
integer programming
0 references
zero pattern constraints
0 references
directed (bipartite) graph
0 references
\(\mathsf{L}\)-free graph
0 references
0 references
0 references
0 references
0.8550304174423218
0 references
0.7568255662918091
0 references
0.756425142288208
0 references
0.7519444823265076
0 references
