Editing Minimum degree algorithm (section)

==References==
*{{cite journal |first1=Robert |last1=Cummings |first2=Matthew |last2=Fahrbach |first3=Animesh |last3=Fatehpuria |title=A fast minimum degree algorithm and matching lower bound |journal=Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms |year=2021 |pages=724–734 |doi= 10.1137/1.9781611976465.45 |isbn=978-1-61197-646-5 |s2cid=198968052 |arxiv=1907.12119 }}
*{{cite journal |first1=Alan |last1=George |first2=Joseph |last2=Liu |title=The evolution of the minimum degree ordering algorithm |journal=[[SIAM Review]] |volume=31 |issue=1 |pages=1–19 |year=1989 |jstor=2030845 |doi=10.1137/1031001|osti=5686483 }}
*{{citation|first1=P.|last1=Heggernes | author1-link = Pinar Heggernes |first2=S. C. |last2=Eisenstat |first3=G. |last3= Kumfert| first4=A. |last4=Pothen |date=2001 |title=The Computational Complexity of the Minimum Degree Algorithm |type= Technical report |url=https://www.cs.purdue.edu/homes/apothen/Papers/md-conf.pdf |publisher=Institute for Computer Applications in Science and Engineering}}
*{{cite journal |authorlink=Harry Markowitz |first=H. M. |last=Markowitz |title=The elimination form of the inverse and its application to linear programming |journal=[[Management Science: A Journal of the Institute for Operations Research and the Management Sciences|Management Science]] |volume=3 |issue=3 |pages=255–269 |year=1957 |jstor=2627454 |doi=10.1287/mnsc.3.3.255|url=http://www.dtic.mil/get-tr-doc/pdf?AD=AD0604711 |archive-url=https://web.archive.org/web/20170924000209/http://www.dtic.mil/get-tr-doc/pdf?AD=AD0604711 |url-status=dead |archive-date=September 24, 2017 }}
*{{cite book |first=D. J. |last=Rose |chapter=A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations |title=Graph Theory and Computing |publisher=Academic Press |year=1972 |pages=183–217 |isbn=0-12-583850-6 }}
*{{cite journal |first1=W. F. |last1=Tinney |first2=J. W. |last2=Walker |title=Direct solution of sparse network equations by optimally ordered triangular factorization |journal=[[Proceedings of the IEEE|Proc. IEEE]] |volume=55 |issue=11 |pages=1801–1809 |year=1967 |doi=10.1109/PROC.1967.6011 }}

{{Numerical linear algebra}}

{{DEFAULTSORT:Minimum Degree Algorithm}}
[[Category:Numerical linear algebra]]
[[Category:Matrix theory]]