BACK TO INDEX

Publications about 'Minimum degree ordering algorithm' on CSC

Articles in journal or book chapters

1. C. Ashcraft and J. W. H. Liu. Robust ordering of sparse matrices using multisection. SIAM Journal on Matrix Analysis and Applications, 19(3):816-832, 1998. Keyword(s): Sparse matrix ordering, Minimum degree algorithm, Nested dissection.



2. B. Hendrickson and E. Rothberg. Improving the run time and quality of nested dissection ordering. SIAM Journal on Scientific Computing, 20(2):468-489, 1998. Keyword(s): Sparse matrix ordering, Nested dissection, Minimum degree algorithm, Minimum degree ordering, Graph algorithms, Graph partitioning.



3. P. R. Amestoy, T. A. Davis, and I. S. Duff. An approximate minimum degree ordering algorithm. SIAM Journal on Matrix Analysis and Applications, 17(4):886-905, 1996. Keyword(s): Sparse matrix ordering, Minimum degree algorithm.



4. C. Ashcraft. Compressed graphs and the minimum degree algorithm. SIAM Journal on Scientific Computing, 16:1404-1411, 1995. Keyword(s): Minimum degree algorithm.



5. A. George and J. W. H. Liu. The evolution of the minimum degree ordering algorithm. SIAM Review, 31(1):1-19, 1989. Keyword(s): Sparse matrix ordering, Minimum degree algorithm, Computational complexity.



6. J. W. H. Liu. The minimum degree ordering with constraints. SIAM Journal on Scientific and Statistical Computing, 10(6):1136-1145, 1989. Keyword(s): Minimum degree ordering.



7. D. J. Rose. A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In R. C. Read, editor, Graph Theory and Computing, pages 183-217. Academic Press, 1972. Keyword(s): Minimum degree algorithm.



8. W. F. Tinney and J. W. Walker. Direct solutions of sparse network equations by optimally ordered triangular factorization. Proceedings of the IEEE, 55(11):1801-1809, Nov. 1967. Keyword(s): Minimum degree algorithm.

Conference articles

1. B. Hendrickson and A. Pothen. Combinatorial scientific computing: The enabling power of discrete algorithms in computational science. In M. Dayde, M. L. M. Palma, L. G. A. Coutinho, E. Pacitti, and J. C. Lopes, editors, High Performance Computing for Computational Science---VECPAR 2006, volume 4395 of Lecture Notes in Computer Science, pages 260-280, 2007. Keyword(s): Minimum degree ordering algorithm, Coloring, Jacobian matrix, Sparse Hessian matrix.

BACK TO INDEX

---

Last modified: Wed Jul 21 11:49:20 2010
Author: Bora Uçar.