Key points are not available for this paper at this time.
AMD is a set of routines that implements the approximate minimum degree ordering algorithm to permute sparse matrices prior to numerical factorization. There are versions written in both C and Fortran 77. A MATLAB interface is included.
Amestoy et al. (Wed,) studied this question.