{"id":"https://openalex.org/W2014730252","doi":"https://doi.org/10.1137/s0895479894278952","title":"An Approximate Minimum Degree Ordering Algorithm","display_name":"An Approximate Minimum Degree Ordering Algorithm","publication_year":1996,"publication_date":"1996-10-01","ids":{"openalex":"https://openalex.org/W2014730252","doi":"https://doi.org/10.1137/s0895479894278952","mag":"2014730252"},"language":"en","primary_location":{"id":"doi:10.1137/s0895479894278952","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895479894278952","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Matrix Analysis and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107116766","display_name":"Patrick Amestoy","orcid":"https://orcid.org/0000-0002-8559-9600"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Patrick R. Amestoy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069178025","display_name":"Timothy A. Davis","orcid":"https://orcid.org/0000-0001-7614-6899"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Timothy A. Davis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111633713","display_name":"Iain Duff","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Iain S. Duff","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":20.1588,"has_fulltext":false,"cited_by_count":731,"citation_normalized_percentile":{"value":0.99670396,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"17","issue":"4","first_page":"886","last_page":"905"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.8213390111923218},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7537510395050049},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5317589044570923},{"id":"https://openalex.org/keywords/quotient","display_name":"Quotient","score":0.5152457356452942},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5059332251548767},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.45236819982528687},{"id":"https://openalex.org/keywords/minimum-degree-algorithm","display_name":"Minimum degree algorithm","score":0.44402721524238586},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44345802068710327},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41845250129699707},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.3703256845474243},{"id":"https://openalex.org/keywords/incomplete-cholesky-factorization","display_name":"Incomplete Cholesky factorization","score":0.2062877118587494}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.8213390111923218},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7537510395050049},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5317589044570923},{"id":"https://openalex.org/C199422724","wikidata":"https://www.wikidata.org/wiki/Q41118","display_name":"Quotient","level":2,"score":0.5152457356452942},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5059332251548767},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.45236819982528687},{"id":"https://openalex.org/C46085209","wikidata":"https://www.wikidata.org/wiki/Q17098969","display_name":"Minimum degree algorithm","level":5,"score":0.44402721524238586},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44345802068710327},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41845250129699707},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.3703256845474243},{"id":"https://openalex.org/C44363057","wikidata":"https://www.wikidata.org/wiki/Q6015160","display_name":"Incomplete Cholesky factorization","level":4,"score":0.2062877118587494},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0895479894278952","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895479894278952","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Matrix Analysis and Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.51.7057","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.7057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cerfacs.fr/pub/algo/reports/TR_PA_95_09.ps.gz","raw_type":"text"},{"id":"pmh:oai:epubs.cclrc.ac.uk:work/32935","is_oa":false,"landing_page_url":"http://purl.org/net/epubs/work/32935","pdf_url":null,"source":{"id":"https://openalex.org/S4306400334","display_name":"Science and Technology Facilities Council","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162524378","host_organization_name":"Science and Technology Facilities Council","host_organization_lineage":["https://openalex.org/I162524378"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W89281171","https://openalex.org/W171063220","https://openalex.org/W1972859808","https://openalex.org/W1973101972","https://openalex.org/W1981885118","https://openalex.org/W1984921897","https://openalex.org/W1989689661","https://openalex.org/W2007259720","https://openalex.org/W2026121678","https://openalex.org/W2027566319","https://openalex.org/W2027851979","https://openalex.org/W2034197136","https://openalex.org/W2052602889","https://openalex.org/W2063675347","https://openalex.org/W2069857942","https://openalex.org/W2083287906","https://openalex.org/W2086648616","https://openalex.org/W2087830284","https://openalex.org/W2088160222","https://openalex.org/W2092097552","https://openalex.org/W2096559782","https://openalex.org/W2125720043","https://openalex.org/W2147542748","https://openalex.org/W2752885492","https://openalex.org/W4249812622"],"related_works":["https://openalex.org/W1509943448","https://openalex.org/W2526784484","https://openalex.org/W2074431240","https://openalex.org/W232494833","https://openalex.org/W253708524","https://openalex.org/W2015874996","https://openalex.org/W1987177655","https://openalex.org/W2050448951","https://openalex.org/W2143133118","https://openalex.org/W3202820144"],"abstract_inverted_index":{"Abstract.":[0],"An":[1],"approximate":[2],"minimum":[3,41,64,82],"degree":[4,65,83],"(AMD),":[5],"ordering":[6,66],"algorithm":[7,57],"for":[8,28,39],"preordering":[9],"a":[10],"symmetric":[11],"sparse":[12],"matrix":[13,29],"prior":[14],"to":[15,34,51],"numerical":[16],"factorization":[17,30],"is":[18,58],"presented.":[19],"We":[20,43],"use":[21],"techniques":[22],"based":[23],"on":[24],"the":[25,40,52,77],"quotient":[26],"graph":[27],"that":[31,45,71],"allow":[32],"us":[33],"obtain":[35],"computationally":[36],"cheap":[37],"bounds":[38,47],"degree.":[42,54],"show":[44],"these":[46],"are":[48,72],"often":[49],"equal":[50],"actual":[53],"The":[55],"resulting":[56],"typically":[59],"much":[60],"faster":[61],"than":[62],"previous":[63],"algorithms":[67],"and":[68],"produces":[69],"results":[70],"comparable":[73],"in":[74],"quality":[75],"with":[76],"best":[78],"orderings":[79],"from":[80],"other":[81],"algorithms.":[84]},"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":18},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":18},{"year":2022,"cited_by_count":20},{"year":2021,"cited_by_count":28},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":30},{"year":2017,"cited_by_count":53},{"year":2016,"cited_by_count":36},{"year":2015,"cited_by_count":28},{"year":2014,"cited_by_count":30},{"year":2013,"cited_by_count":38},{"year":2012,"cited_by_count":40}],"updated_date":"2026-08-22T07:34:49.880490","created_date":"2025-10-10T00:00:00"}