Computing the block triangular form of a sparse matrix (Q4371656): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093992309 / rank | |||
Normal rank | |||
Latest revision as of 23:02, 19 March 2024
scientific article; zbMATH DE number 1106048
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the block triangular form of a sparse matrix |
scientific article; zbMATH DE number 1106048 |
Statements
Computing the block triangular form of a sparse matrix (English)
0 references
9 February 1998
0 references
bipartite graphs
0 references
algorithms
0 references
Dulmage-Mendelsohn decomposition
0 references
maximum matchings
0 references
