Patrick Amestoy, Timothy A. Davis, and Iain S. Duff. An approximation minimum degree ordering algorithm. SIAM J. Matrix Analysis and Applications, 17(4):886--905, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Generic Graph Algorithms for Sparse Matrix Ordering - Lee, Siek, Lumsdaine (1999) (2 citations) (Correct)
....approaches differ from minimum degree by the choice of minimization criteria for choosing new vertices. For example, to accelerate one of the primary bottlenecks of the ordering process, the Approximate Minimum Degree (AMD) algorithm uses an estimate of the degree (or external degree) of a vertex [14]. The Minimum Deficiency class of algorithms instead choose the vertex that would create the minimum number of fill in elements. A nice comparison of many of these different approaches can be found in [11] 7 5 Implementation Our GGCL based implementation of MMD closely follows the algorithmic ....
Patrick Amestoy, Timothy A. Davis, and Iain S. Duff. An approximation minimum degree ordering algorithm. SIAM J. Matrix Analysis and Applications, 17(4):886--905, 1996.
Generic Graph Algorithms for Sparse Matrix Ordering - Lee, Siek, Lumsdaine (1999) (2 citations) (Correct)
No context found.
Patrick Amestoy, TimothyA.Davis, and Iain S. Du#. An approximation minimum degree ordering algorithm. SIAM J. Matrix Analysis and Applications, 17#4#:886# 905, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC