The Minimum Degree Ordering with Constraints
- 1 November 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 10 (6) , 1136-1145
- https://doi.org/10.1137/0910069
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- The Evolution of the Minimum Degree Ordering AlgorithmSIAM Review, 1989
- Computational models and task scheduling for parallel sparse Cholesky factorizationParallel Computing, 1986
- Modification of the minimum-degree algorithm by multiple eliminationACM Transactions on Mathematical Software, 1985
- Sparse matrix test problemsACM SIGNUM Newsletter, 1982
- A Data Structure for Parallel L/U DecompositionIEEE Transactions on Computers, 1982
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Incomplete Nested Dissection for Solving n by n Grid ProblemsSIAM Journal on Numerical Analysis, 1978
- On George’s Nested Dissection MethodSIAM Journal on Numerical Analysis, 1976
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970