{"id":"https://openalex.org/W2058141892","doi":"https://doi.org/10.1137/070680680","title":"Fast Computation of Minimal Fill Inside A Given Elimination Ordering","display_name":"Fast Computation of Minimal Fill Inside A Given Elimination Ordering","publication_year":2008,"publication_date":"2008-12-04","ids":{"openalex":"https://openalex.org/W2058141892","doi":"https://doi.org/10.1137/070680680","mag":"2058141892"},"language":"en","primary_location":{"id":"doi:10.1137/070680680","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070680680","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/A5022828497","display_name":"Pinar Heggernes","orcid":"https://orcid.org/0000-0001-9460-4355"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pinar Heggernes","raw_affiliation_strings":["pinar@ii.uib.no#TAB#"],"affiliations":[{"raw_affiliation_string":"pinar@ii.uib.no#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050129306","display_name":"Barry W. Peyton","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Barry W. Peyton","raw_affiliation_strings":["bpeyton@daltonstate.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"bpeyton@daltonstate.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022828497"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4116,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.67698533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"30","issue":"4","first_page":"1424","last_page":"1444"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6409938335418701},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6389100551605225},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5798795223236084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5488010048866272},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5236777663230896},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5218825936317444},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4932939410209656},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4918687343597412},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.4558878540992737},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4290030002593994},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3857876658439636},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3421592712402344},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3307143449783325}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6409938335418701},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6389100551605225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5798795223236084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5488010048866272},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5236777663230896},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5218825936317444},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4932939410209656},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4918687343597412},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.4558878540992737},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4290030002593994},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3857876658439636},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3421592712402344},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3307143449783325},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/070680680","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070680680","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.145.660","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/publikasjoner/texrap/pdf/2007-343.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.864.6296","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.864.6296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/%7Epinar/sandwich-rev8.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1551907897","https://openalex.org/W1575490381","https://openalex.org/W1593793857","https://openalex.org/W1796399974","https://openalex.org/W1820739428","https://openalex.org/W1966454892","https://openalex.org/W1970792753","https://openalex.org/W1980629456","https://openalex.org/W1981917097","https://openalex.org/W1991477862","https://openalex.org/W2014730252","https://openalex.org/W2027566319","https://openalex.org/W2030064859","https://openalex.org/W2046020107","https://openalex.org/W2061782500","https://openalex.org/W2063694895","https://openalex.org/W2066867008","https://openalex.org/W2067692416","https://openalex.org/W2077309453","https://openalex.org/W2086119402","https://openalex.org/W2086648616","https://openalex.org/W2089465933","https://openalex.org/W2089790965","https://openalex.org/W2090579013","https://openalex.org/W2125720043","https://openalex.org/W2137541800","https://openalex.org/W3142428054"],"related_works":["https://openalex.org/W4317939968","https://openalex.org/W4360764540","https://openalex.org/W4231657010","https://openalex.org/W2395986200","https://openalex.org/W4390144857","https://openalex.org/W1994552539","https://openalex.org/W2007917622","https://openalex.org/W2385305544","https://openalex.org/W1985852812","https://openalex.org/W1549756090"],"abstract_inverted_index":{"Minimal":[0],"elimination":[1],"orderings":[2,23],"were":[3,33],"introduced":[4],"by":[5,74,92],"Rose,":[6],"Tarjan,":[7],"and":[8,12,31,78,102,186,194,205,224,262],"Lueker":[9],"in":[10,27,36,41,54,133,180,242,265],"1976,":[11],"during":[13],"the":[14,89,93,161,177,190,197,201,208,248],"last":[15],"decade":[16],"they":[17,32,129,136,144,150],"have":[18,24,137,145],"received":[19],"increasing":[20],"attention.":[21],"Such":[22],"important":[25],"applications":[26,67],"several":[28,105],"different":[29],"fields,":[30],"first":[34,249],"studied":[35],"connection":[37],"with":[38,258],"minimizing":[39],"fill":[40,55,83,90],"sparse":[42,203],"matrix":[43,204],"computations.":[44],"Rather":[45],"than":[46],"computing":[47],"any":[48],"minimal":[49,82],"ordering,":[50],"which":[51],"might":[52,130],"result":[53],"that":[56,84,116,237,250],"is":[57,62,85,115,119,207,221,240,247,263],"far":[58],"from":[59,70],"minimum,":[60],"it":[61],"more":[63],"desirable":[64],"for":[65,107,175],"practical":[66],"to":[68,159,200,235],"start":[69],"an":[71,171],"ordering":[72],"produced":[73,91],"a":[75,81,86,138,152,253],"fill-reducing":[76],"heuristic":[77],"then":[79],"compute":[80],"subset":[87],"of":[88,112,155,192,196,213,219],"given":[94,123],"heuristic.":[95],"This":[96],"problem":[97,179],"has":[98,252],"been":[99,147],"addressed":[100],"previously,":[101],"there":[103,118],"are":[104],"algorithms":[106,114],"solving":[108,176],"it.":[109],"The":[110],"drawback":[111],"these":[113],"either":[117],"no":[120],"theoretical":[121,140,163],"bound":[122],"on":[124],"their":[125],"running":[126,141,256],"time,":[127,142,183],"although":[128],"run":[131,231],"fast":[132,241,264],"practice,":[134],"or":[135,149],"good":[139,162,255],"but":[143],"never":[146],"implemented,":[148],"require":[151],"large":[153],"machinery":[154],"complicated":[156],"data":[157],"structures":[158],"achieve":[160],"time":[164,232,257],"bound.":[165],"In":[166],"this":[167],"paper,":[168],"we":[169],"present":[170,230],"algorithm":[172,239,246],"called":[173],"MCS-ETree":[174,220],"mentioned":[178],"$O(nm":[181],"A(m,n))$":[182],"where":[184],"m":[185],"n":[187],"are,":[188],"respectively,":[189],"number":[191],"edges":[193],"vertices":[195],"graph":[198],"corresponding":[199],"input":[202],"$A(m,n)$":[206],"very":[209],"slowly":[210],"growing":[211],"inverse":[212],"Ackerman's":[214],"function.":[215],"A":[216],"primary":[217],"strength":[218],"its":[222,225],"simplicity":[223],"straightforward":[226],"implementation":[227,260],"details.":[228],"We":[229],"test":[233],"results":[234],"show":[236],"our":[238,245],"practice.":[243,266],"Thus":[244],"both":[251],"provably":[254],"easy":[259],"details":[261]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}