{"id":"https://openalex.org/W1970792753","doi":"https://doi.org/10.1137/s089547989936443x","title":"Minimal Orderings Revisited","display_name":"Minimal Orderings Revisited","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1970792753","doi":"https://doi.org/10.1137/s089547989936443x","mag":"1970792753"},"language":"en","primary_location":{"id":"doi:10.1137/s089547989936443x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s089547989936443x","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/A5050129306","display_name":"Barry W. Peyton","orcid":null},"institutions":[{"id":"https://openalex.org/I1289243028","display_name":"Oak Ridge National Laboratory","ror":"https://ror.org/01qz5mb56","country_code":"US","type":"facility","lineage":["https://openalex.org/I1289243028","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I4210159294"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Barry W. Peyton","raw_affiliation_strings":["Department of Commerce, 5285 Port Royal Rd., Sprin@}eld, VA 22161","Oak Ridge, TN 37831"],"affiliations":[{"raw_affiliation_string":"Department of Commerce, 5285 Port Royal Rd., Sprin@}eld, VA 22161","institution_ids":[]},{"raw_affiliation_string":"Oak Ridge, TN 37831","institution_ids":["https://openalex.org/I1289243028"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050129306"],"corresponding_institution_ids":["https://openalex.org/I1289243028"],"apc_list":null,"apc_paid":null,"fwci":2.69,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.88880243,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"23","issue":"1","first_page":"271","last_page":"294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9988999962806702,"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/T11567","display_name":"semigroups and automata theory","score":0.9988999962806702,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/T12029","display_name":"DNA and Biological Computing","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7533658742904663},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6027735471725464},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5428237318992615},{"id":"https://openalex.org/keywords/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.5008351802825928},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47421765327453613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4472469091415405},{"id":"https://openalex.org/keywords/minimum-degree-algorithm","display_name":"Minimum degree algorithm","score":0.4392232298851013},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35840678215026855},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2396034598350525}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7533658742904663},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6027735471725464},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5428237318992615},{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.5008351802825928},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47421765327453613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4472469091415405},{"id":"https://openalex.org/C46085209","wikidata":"https://www.wikidata.org/wiki/Q17098969","display_name":"Minimum degree algorithm","level":5,"score":0.4392232298851013},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35840678215026855},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2396034598350525},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C44363057","wikidata":"https://www.wikidata.org/wiki/Q6015160","display_name":"Incomplete Cholesky factorization","level":4,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s089547989936443x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s089547989936443x","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1966454892","https://openalex.org/W2014730252","https://openalex.org/W2027566319","https://openalex.org/W2029635056","https://openalex.org/W2037106315","https://openalex.org/W2066818671","https://openalex.org/W2068683191","https://openalex.org/W2070232376","https://openalex.org/W2076455760","https://openalex.org/W2077309453","https://openalex.org/W2086119402","https://openalex.org/W2086648616","https://openalex.org/W2089790965","https://openalex.org/W2089898547","https://openalex.org/W2096559782","https://openalex.org/W2101501830"],"related_works":["https://openalex.org/W2039814159","https://openalex.org/W3210095423","https://openalex.org/W2403987929","https://openalex.org/W2138563672","https://openalex.org/W2966537581","https://openalex.org/W2374847384","https://openalex.org/W1558108883","https://openalex.org/W2784059180","https://openalex.org/W2342101233","https://openalex.org/W2356488190"],"abstract_inverted_index":{"When":[0],"minimum":[1],"orderings":[2,16,42,109,114,117,126,147,154,162],"proved":[3],"too":[4],"difficult":[5],"to":[6,19,60,71,104,167],"deal":[7],"with,":[8],"Rose,":[9,50,79],"Tarjan,":[10,51,80],"and":[11,17,52,64,81,91,133],"Lueker":[12],"instead":[13],"studied":[14],"minimal":[15,41,97,108,156],"how":[18],"compute":[20],"them":[21],"[SIAM":[22],"J.":[23],"Comput.,":[24],"5":[25],"(1976),":[26],"pp.":[27],"266--283].":[28],"This":[29],"paper":[30],"introduces":[31],"an":[32],"algorithm":[33,48,85],"that":[34,139],"is":[35,57,99,102],"capable":[36],"of":[37,49,74,78],"computing":[38],"much":[39,43],"better":[40],"more":[44],"efficiently":[45],"than":[46],"the":[47,75,119,140,144,152],"Lueker.":[53,82],"The":[54,83],"new":[55,84],"insight":[56],"a":[58,96],"way":[59],"use":[61],"certain":[62],"structures":[63],"concepts":[65],"from":[66],"modern":[67],"sparse":[68],"Cholesky":[69],"solvers":[70],"reexpress":[72],"one":[73],"basic":[76],"results":[77,131],"begins":[86],"with":[87],"any":[88],"initial":[89,116,125,145,153],"ordering":[90,98],"then":[92],"refines":[93],"it":[94],"until":[95],"obtained.":[100],"It":[101],"simple":[103],"obtain":[105],"high-quality":[106],"low-cost":[107],"by":[110,136],"using":[111],"fill-reducing":[112],"heuristic":[113,146],"as":[115],"for":[118],"algorithm.":[120],"We":[121],"examine":[122],"several":[123],"such":[124],"in":[127],"some":[128,164],"detail.":[129],"Our":[130],"here":[132],"previous":[134],"work":[135],"others":[137],"indicate":[138],"improvements":[141],"obtained":[142],"over":[143],"are":[148,155],"relatively":[149],"small":[150],"because":[151],"or":[157],"nearly":[158],"minimal.":[159],"Nested":[160],"dissection":[161],"provide":[163],"significant":[165],"exceptions":[166],"this":[168],"rule.":[169]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":23},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}