A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs

Full text

Pdf (1.20 MB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 6 , Issue 3 (September 1980) table of contents

Pages: 337 - 358

Year of Publication: 1980

ISSN:0098-3500

Authors

Alan George	Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Joseph W. H. Liu	Systems Diemensions Ltd., 111 Avenue Road, Toronto, Ontario, Canada

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 38, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355900.355906 What is a DOI?

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	BERGE, C. The Theory of Graphs and Its Applications. Wiley, New York, 1962.
	2	EISENSTAT, S.C., GURSKY, M.C., SCHULTZ, M.H., AND SHERMAN, A.H. Yale sparse matrLx package. I: The symmetric codes. Res. Rep. 112. Computer Science Dep., Yale Univ., New Haven, Conn.
	3	GEORGE, A., AND LIU, J.W.H. Algorithms for matrix partitioning and the numerical solution of finite element systems SIAM J. Numer. Anal. 15 (1978), 293-327.
	4	GEORGE, A., AND LIU, J.W.H. An automatic nested dissection algorithm for h-regular finite element problems. SIAM J. Numer. Anal. 15 (1978), 1053-1069.
	5	GEORGE, A., AND LIU, J.W.H. A mimmal storage implementation of the mmnnum degree algorithm SIAM J. Numer Anal. 17 (1980), 283-299.
	6	GEORGE, A., AND LIU, J.W.H. A quotient graph model for symmetric factorization. Sparse Matrix Proceedings 1978, I.S. Duff and G.W. Stewart, Eds., SIAM Pubhcations, 1978, pp. 154- 175.
	7	PARTER, S.V., The use of linear graphs in Gauss elimination. SIAM Rev. 3 (1961), 364-369.
	8	RosE, D.J. A graph theoretic study of the numerical solution of sparse positive definite systems. In Graph Theory and Computing, R.C. Read, Ed. Academic Press, New York, 1972.
	9	ROSE, D.J., TARJAN, R.E., AND LUEKER, G.S. Algorithmic aspects of vertex ehmmation on graphs. SIAM J. Comput. 5 (1975), 266-283.

CITED BY 2

	Joseph W. H. Liu, Modification of the minimum-degree algorithm by multiple elimination, ACM Transactions on Mathematical Software (TOMS), v.11 n.2, p.141-153, June 1985
	Dany Mezher , Bernard Philippe, Parallel computation of pseudospectra of large sparse matrices, Parallel Computing, v.28 n.2, p.199-221, February 2002