{"id":"https://openalex.org/W2021989496","doi":"https://doi.org/10.1145/1412228.1412229","title":"A backtracking-based algorithm for hypertree decomposition","display_name":"A backtracking-based algorithm for hypertree decomposition","publication_year":2008,"publication_date":"2008-10-07","ids":{"openalex":"https://openalex.org/W2021989496","doi":"https://doi.org/10.1145/1412228.1412229","mag":"2021989496"},"language":"en","primary_location":{"id":"doi:10.1145/1412228.1412229","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1412228.1412229","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/cs/0701083","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050151740","display_name":"Georg Gottlob","orcid":"https://orcid.org/0000-0002-2353-5230"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Georg Gottlob","raw_affiliation_strings":["University of Oxford, Oxford, England, UK","University of Oxford, Oxford, England,UK#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, England, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"University of Oxford, Oxford, England,UK#TAB#","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021237641","display_name":"Marko Samer","orcid":null},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Marko Samer","raw_affiliation_strings":["University of Durham, Durham, England, UK"],"affiliations":[{"raw_affiliation_string":"University of Durham, Durham, England, UK","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050151740"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":4.1096,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.93503253,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"13","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.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/T10829","display_name":"Interconnection Networks and Systems","score":0.9883999824523926,"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/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.9710613489151001},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.7631990909576416},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5691277980804443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5455661416053772},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5352208614349365},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5166012048721313},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4775872230529785},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4477887749671936},{"id":"https://openalex.org/keywords/nesting","display_name":"Nesting (process)","score":0.43103542923927307},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4271073341369629},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42620381712913513},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.364014208316803},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2397960126399994},{"id":"https://openalex.org/keywords/hyperbolic-geometry","display_name":"Hyperbolic geometry","score":0.07612401247024536},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.06537759304046631}],"concepts":[{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.9710613489151001},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7631990909576416},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5691277980804443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5455661416053772},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5352208614349365},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5166012048721313},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4775872230529785},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4477887749671936},{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.43103542923927307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4271073341369629},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42620381712913513},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.364014208316803},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2397960126399994},{"id":"https://openalex.org/C206352148","wikidata":"https://www.wikidata.org/wiki/Q209306","display_name":"Hyperbolic geometry","level":3,"score":0.07612401247024536},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.06537759304046631},{"id":"https://openalex.org/C191897082","wikidata":"https://www.wikidata.org/wiki/Q11467","display_name":"Metallurgy","level":1,"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/C192939610","wikidata":"https://www.wikidata.org/wiki/Q188444","display_name":"Differential geometry","level":2,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1412228.1412229","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1412228.1412229","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0701083","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0701083","pdf_url":"https://arxiv.org/pdf/cs/0701083","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:cs/0701083","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0701083","pdf_url":"https://arxiv.org/pdf/cs/0701083","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6200000047683716,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G598941964","display_name":null,"funder_award_id":"P17222-N04","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W102939475","https://openalex.org/W1858603130","https://openalex.org/W1967265779","https://openalex.org/W1984868905","https://openalex.org/W2033325972","https://openalex.org/W2057186622","https://openalex.org/W2065023965","https://openalex.org/W2125895230","https://openalex.org/W2167634979","https://openalex.org/W2174973502","https://openalex.org/W2337098149","https://openalex.org/W2628596753","https://openalex.org/W2914617426","https://openalex.org/W6682443978"],"related_works":["https://openalex.org/W5383638","https://openalex.org/W1978042415","https://openalex.org/W1485630101","https://openalex.org/W2498017833","https://openalex.org/W112744582","https://openalex.org/W1525406239","https://openalex.org/W2951209234","https://openalex.org/W1787617900","https://openalex.org/W2196669557","https://openalex.org/W2021989496"],"abstract_inverted_index":{"Hypertree":[0],"decompositions":[1,9,84],"of":[2,7,10,28,52,85],"hypergraphs":[3,51,125],"are":[4,39,126],"a":[5,16],"generalization":[6],"tree":[8],"graphs.":[11],"The":[12],"corresponding":[13],"hypertree-width":[14],"is":[15,48],"measure":[17],"for":[18,25,81],"the":[19,26,29,57,59,61,63,74,102,113,124],"acyclicity":[20],"and":[21,36],"therefore":[22],"an":[23],"indicator":[24],"tractability":[27],"associated":[30],"computation":[31,37,64],"problem.":[32],"Several":[33],"NP-hard":[34],"decision":[35],"problems":[38],"known":[40],"to":[41,112],"be":[42,67],"tractable":[43],"on":[44],"instances":[45],"whose":[46],"structure":[47],"represented":[49],"by":[50],"bounded":[53],"hypertree-width.":[54],"Roughly":[55],"speaking,":[56],"smaller":[58],"hypertree-width,":[60],"faster":[62],"problem":[65],"can":[66],"solved.":[68],"In":[69],"this":[70],"paper,":[71],"we":[72,117],"present":[73],"new":[75],"backtracking-based":[76],"algorithm":[77,107],"det-":[78,94],"k":[79,95,100],"-decomp":[80,96],"computing":[82],"hypertree":[83,105],"small":[86],"width.":[87],"Our":[88],"benchmark":[89],"evaluations":[90],"have":[91],"shown":[92],"that":[93],"significantly":[97],"outperforms":[98],"opt-":[99],"-decomp,":[101],"only":[103],"exact":[104],"decomposition":[106],"so":[108],"far.":[109],"Even":[110],"compared":[111],"best":[114],"heuristic":[115],"algorithm,":[116],"obtained":[118],"competitive":[119],"results":[120],"as":[121,123],"long":[122],"sufficiently":[127],"simple.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2016-06-24T00:00:00"}