ACM Home Page
Please provide us with feedback. Feedback
Algorithm 529: Permutations To Block Triangular Form [F1]
Full text PdfPdf (199 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 4 ,  Issue 2  (June 1978) table of contents
Pages: 189 - 192  
Year of Publication: 1978
ISSN:0098-3500
Authors
I. S. Duff  Computer Science and Systems Division, Building 8.9, AERE Harwell, Didcot, Oxfordshire, OX11 ORA, England
J. K. Reid  Computer Science and Systems Division, Building 8.9, AERE Harwell, Didcot, Oxfordshire, OX11 ORA, England
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 60,   Citation Count: 6
Additional Information:

appendices and supplements   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/355780.355790
What is a DOI?

APPENDICES and SUPPLEMENTS
finding symmetric permutations to block triangular form That is, given the column numbers of the nonzeros in each row of a sparse matrix, this subroutine finds a symmetric permutation that makes the matrix block lower triangular.
Gams: D2e


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
DUFF, I.S. On algorithms for obtaining a maximum transyersal. To appear as a Harwell Report.
2
 
3
TARJXN, R.E. Depth first search and linear graph algorithms. SIAM J. Comput. 1, pp. 146-160.