{"id":"https://openalex.org/W2059372025","doi":"https://doi.org/10.1137/s0097539793251219","title":"A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth","display_name":"A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth","publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W2059372025","doi":"https://doi.org/10.1137/s0097539793251219","mag":"2059372025"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793251219","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793251219","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032730524"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":31.4376,"has_fulltext":false,"cited_by_count":1560,"citation_normalized_percentile":{"value":0.99856037,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"25","issue":"6","first_page":"1305","last_page":"1317"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","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"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.9510840177536011},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7199506163597107},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.7140964269638062},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.7076953649520874},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.6829166412353516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6728982925415039},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.6120834350585938},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5126449465751648},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5086444616317749},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.488841712474823},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47304290533065796},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4670765697956085},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4263764023780823},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4219065010547638},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.41369643807411194},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40694576501846313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3606075644493103},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23115307092666626},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07711467146873474}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9510840177536011},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7199506163597107},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.7140964269638062},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.7076953649520874},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.6829166412353516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6728982925415039},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.6120834350585938},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5126449465751648},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5086444616317749},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.488841712474823},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47304290533065796},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4670765697956085},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4263764023780823},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4219065010547638},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.41369643807411194},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40694576501846313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3606075644493103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23115307092666626},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07711467146873474},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539793251219","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793251219","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W26854244","https://openalex.org/W1636203894","https://openalex.org/W1983860528","https://openalex.org/W1987092466","https://openalex.org/W1991755800","https://openalex.org/W2000611521","https://openalex.org/W2005079828","https://openalex.org/W2010600799","https://openalex.org/W2012154006","https://openalex.org/W2013967419","https://openalex.org/W2017492235","https://openalex.org/W2018876684","https://openalex.org/W2028357390","https://openalex.org/W2029448190","https://openalex.org/W2034501206","https://openalex.org/W2036740975","https://openalex.org/W2043344835","https://openalex.org/W2047871605","https://openalex.org/W2057826895","https://openalex.org/W2064796716","https://openalex.org/W2067514766","https://openalex.org/W2085550081","https://openalex.org/W2098879666","https://openalex.org/W2115666768","https://openalex.org/W2125058377","https://openalex.org/W2143406303","https://openalex.org/W3021010896","https://openalex.org/W4213368513","https://openalex.org/W4232553506"],"related_works":["https://openalex.org/W2027388354","https://openalex.org/W2084535634","https://openalex.org/W2949315077","https://openalex.org/W1572255008","https://openalex.org/W2584271047","https://openalex.org/W2091382007","https://openalex.org/W1874754796","https://openalex.org/W143512583","https://openalex.org/W4285428820","https://openalex.org/W2111290740"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,71],"give":[4],"for":[5,74],"constant":[6,81],"k":[7,27],"a":[8,13,32,58,66],"linear-time":[9,59],"algorithm":[10],"that,":[11],"given":[12],"graph":[14],"$G":[15],"=":[16],"(V,E)$,":[17],"determines":[18],"whether":[19],"the":[20],"treewidth":[21,37],"of":[22,34,48],"G":[23,35],"is":[24,43,64],"at":[25,38,78],"most":[26,39,79],"and,":[28],"if":[29],"so,":[30],"finds":[31],"tree-decomposition":[33],"with":[36,76],"k.":[40,82],"A":[41],"consequence":[42,63],"that":[44,50,65],"every":[45],"minor-closed":[46],"class":[47],"graphs":[49,56],"does":[51],"not":[52],"contain":[53],"all":[54],"planar":[55],"has":[57],"recognition":[60],"algorithm.":[61],"Another":[62],"similar":[67],"result":[68],"holds":[69],"when":[70],"look":[72],"instead":[73],"path-decompositions":[75],"pathwidth":[77],"some":[80]},"counts_by_year":[{"year":2026,"cited_by_count":14},{"year":2025,"cited_by_count":34},{"year":2024,"cited_by_count":28},{"year":2023,"cited_by_count":33},{"year":2022,"cited_by_count":56},{"year":2021,"cited_by_count":62},{"year":2020,"cited_by_count":69},{"year":2019,"cited_by_count":64},{"year":2018,"cited_by_count":89},{"year":2017,"cited_by_count":52},{"year":2016,"cited_by_count":69},{"year":2015,"cited_by_count":63},{"year":2014,"cited_by_count":84},{"year":2013,"cited_by_count":94},{"year":2012,"cited_by_count":88}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}