.png){kind=icon}
Return
Computing the block triangular form of a sparse matrix
.png){kind=icon}
OA
AI
DOI：10.1145/98267.98287.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the problem of permuting the rows and columns of a rectangular or square, unsymmetric sparse matrix to compute its block triangular form. This block triangular form is based on a canonical decomposition of bipartite graphs induced by a maximum matching and was discovered by Dulmage and Mendelsohn. We describe implementations of algorithms to compute the block triangular form and provide computational results on sparse matrices from test collections. Several applications of the block triangular form are also included.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available