{"id":"https://openalex.org/W2038049091","doi":"https://doi.org/10.1137/050643350","title":"Exact Algorithms for Treewidth and Minimum Fill-In","display_name":"Exact Algorithms for Treewidth and Minimum Fill-In","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2038049091","doi":"https://doi.org/10.1137/050643350","mag":"2038049091"},"language":"en","primary_location":{"id":"doi:10.1137/050643350","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050643350","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1956/1151","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4210108340","display_name":"University of International Business","ror":"https://ror.org/01rvqzw67","country_code":"KZ","type":"education","lineage":["https://openalex.org/I4210108340"]}],"countries":["KZ"],"is_corresponding":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["fomin@ii.uib.no and yngvev@ii.uib.no#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"fomin@ii.uib.no and yngvev@ii.uib.no#TAB#","institution_ids":["https://openalex.org/I4210108340"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109894460","display_name":"Dieter Kratsch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dieter Kratsch","raw_affiliation_strings":["kratsch@univ-metz.fr#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"kratsch@univ-metz.fr#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081733098","display_name":"Ioan Todinca","orcid":"https://orcid.org/0000-0002-3466-859X"},"institutions":[{"id":"https://openalex.org/I12449238","display_name":"Universit\u00e9 d'Orl\u00e9ans","ror":"https://ror.org/014zrew76","country_code":"FR","type":"education","lineage":["https://openalex.org/I12449238"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ioan Todinca","raw_affiliation_strings":["Ioan.Todinca@univ-orleans.fr#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ioan.Todinca@univ-orleans.fr#TAB#","institution_ids":["https://openalex.org/I12449238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109879985","display_name":"Yngve Villanger","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yngve Villanger","raw_affiliation_strings":["Department of Informatics [Bergen]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics [Bergen]","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.0197,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.98716144,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"38","issue":"3","first_page":"1058","last_page":"1079"},"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.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/treewidth","display_name":"Treewidth","score":0.915513813495636},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8064562678337097},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7006717920303345},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6429473161697388},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5522301197052002},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5348910689353943},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5058550834655762},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4924512803554535},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.32420384883880615},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32228055596351624},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.31714844703674316},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.23498976230621338},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1175781786441803}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.915513813495636},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8064562678337097},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7006717920303345},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6429473161697388},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5522301197052002},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5348910689353943},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5058550834655762},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4924512803554535},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.32420384883880615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32228055596351624},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.31714844703674316},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.23498976230621338},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1175781786441803},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/050643350","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050643350","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.144.3538","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.3538","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/~fomin/fedor/articles1/exactTW_r7.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.153.1561","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.1561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lita.sciences.univ-metz.fr/~kratsch/publications/exactTW.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.701.5188","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.701.5188","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/%7Efomin/articles/2008/2008b.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00462391v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00462391","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 2008, 38 (3), pp.1058-1079. ⟨10.1137/050643350⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:bora.uib.no:1956/1151","is_oa":true,"landing_page_url":"http://hdl.handle.net/1956/1151","pdf_url":null,"source":{"id":"https://openalex.org/S4306401716","display_name":"Duo Research Archive (University of Oslo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I184942183","host_organization_name":"University of Oslo","host_organization_lineage":["https://openalex.org/I184942183"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:bora.uib.no:1956/1151","is_oa":true,"landing_page_url":"http://hdl.handle.net/1956/1151","pdf_url":null,"source":{"id":"https://openalex.org/S4306401716","display_name":"Duo Research Archive (University of Oslo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I184942183","host_organization_name":"University of Oslo","host_organization_lineage":["https://openalex.org/I184942183"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W173980447","https://openalex.org/W1508128762","https://openalex.org/W1533811829","https://openalex.org/W1551907897","https://openalex.org/W1569612812","https://openalex.org/W1582963151","https://openalex.org/W1588788248","https://openalex.org/W1593916827","https://openalex.org/W1934849835","https://openalex.org/W1969186119","https://openalex.org/W1970088964","https://openalex.org/W1985733932","https://openalex.org/W1995725694","https://openalex.org/W2002425091","https://openalex.org/W2007200873","https://openalex.org/W2010030994","https://openalex.org/W2012067448","https://openalex.org/W2014111643","https://openalex.org/W2019137761","https://openalex.org/W2027562075","https://openalex.org/W2027566319","https://openalex.org/W2029448190","https://openalex.org/W2031076941","https://openalex.org/W2045492613","https://openalex.org/W2047033531","https://openalex.org/W2047871605","https://openalex.org/W2049609719","https://openalex.org/W2052812513","https://openalex.org/W2059372025","https://openalex.org/W2070838692","https://openalex.org/W2073025989","https://openalex.org/W2084732238","https://openalex.org/W2085550081","https://openalex.org/W2087083200","https://openalex.org/W2089941644","https://openalex.org/W2092119436","https://openalex.org/W2097844290","https://openalex.org/W2099750557","https://openalex.org/W2104739701","https://openalex.org/W2107351840","https://openalex.org/W2119774304","https://openalex.org/W2127390687","https://openalex.org/W2143474538","https://openalex.org/W2144050783","https://openalex.org/W2156223756","https://openalex.org/W2163938320","https://openalex.org/W2165605193","https://openalex.org/W2913688336","https://openalex.org/W4232845306","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2012687409","https://openalex.org/W2889180046","https://openalex.org/W2029854525","https://openalex.org/W1976784955","https://openalex.org/W1976463682","https://openalex.org/W143512583","https://openalex.org/W1585579706","https://openalex.org/W4297435153","https://openalex.org/W1511821218","https://openalex.org/W2567822775"],"abstract_inverted_index":{"We":[0,39],"show":[1,41],"that":[2,26,42],"the":[3,6,44,50],"treewidth":[4],"and":[5,34],"minimum":[7],"fill-in":[8],"of":[9,46,53],"an":[10,27],"n-vertex":[11,28],"graph":[12,29],"can":[13,56],"be":[14,57],"computed":[15],"in":[16],"time":[17,52],"$\\mathcal{O}(1.8899^n)$.":[18],"Our":[19],"results":[20],"are":[21],"based":[22],"on":[23],"combinatorial":[24],"proofs":[25],"has":[30],"$\\mathcal{O}(1.7087^n)$":[31],"minimal":[32],"separators":[33],"$\\mathcal{O}(1.8135^n)$":[35],"potential":[36],"maximal":[37],"cliques.":[38],"also":[40],"for":[43],"class":[45],"asteroidal":[47],"triple\u2013free":[48],"graphs":[49],"running":[51],"our":[54],"algorithms":[55],"reduced":[58],"to":[59],"$\\mathcal{O}(1.4142^n)$.":[60]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}